Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * INET An implementation of the TCP/IP protocol suite for the LINUX | |
3 | * operating system. INET is implemented using the BSD Socket | |
4 | * interface as the means of communication with the user level. | |
5 | * | |
6 | * Implementation of the Transmission Control Protocol(TCP). | |
7 | * | |
02c30a84 | 8 | * Authors: Ross Biro |
1da177e4 LT |
9 | * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG> |
10 | * Mark Evans, <evansmp@uhura.aston.ac.uk> | |
11 | * Corey Minyard <wf-rch!minyard@relay.EU.net> | |
12 | * Florian La Roche, <flla@stud.uni-sb.de> | |
13 | * Charles Hedrick, <hedrick@klinzhai.rutgers.edu> | |
14 | * Linus Torvalds, <torvalds@cs.helsinki.fi> | |
15 | * Alan Cox, <gw4pts@gw4pts.ampr.org> | |
16 | * Matthew Dillon, <dillon@apollo.west.oic.com> | |
17 | * Arnt Gulbrandsen, <agulbra@nvg.unit.no> | |
18 | * Jorge Cwik, <jorge@laser.satlink.net> | |
19 | */ | |
20 | ||
1da177e4 LT |
21 | #include <linux/mm.h> |
22 | #include <linux/module.h> | |
5a0e3ad6 | 23 | #include <linux/slab.h> |
1da177e4 LT |
24 | #include <linux/sysctl.h> |
25 | #include <linux/workqueue.h> | |
26 | #include <net/tcp.h> | |
27 | #include <net/inet_common.h> | |
28 | #include <net/xfrm.h> | |
29 | ||
e994b7c9 | 30 | int sysctl_tcp_syncookies __read_mostly = 1; |
c6aefafb GG |
31 | EXPORT_SYMBOL(sysctl_tcp_syncookies); |
32 | ||
ab32ea5d | 33 | int sysctl_tcp_abort_on_overflow __read_mostly; |
1da177e4 | 34 | |
295ff7ed ACM |
35 | struct inet_timewait_death_row tcp_death_row = { |
36 | .sysctl_max_tw_buckets = NR_FILE * 2, | |
295ff7ed | 37 | .hashinfo = &tcp_hashinfo, |
295ff7ed | 38 | }; |
295ff7ed ACM |
39 | EXPORT_SYMBOL_GPL(tcp_death_row); |
40 | ||
a2a385d6 | 41 | static bool tcp_in_window(u32 seq, u32 end_seq, u32 s_win, u32 e_win) |
1da177e4 LT |
42 | { |
43 | if (seq == s_win) | |
a2a385d6 | 44 | return true; |
1da177e4 | 45 | if (after(end_seq, s_win) && before(seq, e_win)) |
a2a385d6 | 46 | return true; |
a02cec21 | 47 | return seq == e_win && seq == end_seq; |
1da177e4 LT |
48 | } |
49 | ||
4fb17a60 NC |
50 | static enum tcp_tw_status |
51 | tcp_timewait_check_oow_rate_limit(struct inet_timewait_sock *tw, | |
52 | const struct sk_buff *skb, int mib_idx) | |
53 | { | |
54 | struct tcp_timewait_sock *tcptw = tcp_twsk((struct sock *)tw); | |
55 | ||
56 | if (!tcp_oow_rate_limited(twsk_net(tw), skb, mib_idx, | |
57 | &tcptw->tw_last_oow_ack_time)) { | |
58 | /* Send ACK. Note, we do not put the bucket, | |
59 | * it will be released by caller. | |
60 | */ | |
61 | return TCP_TW_ACK; | |
62 | } | |
63 | ||
64 | /* We are rate-limiting, so just release the tw sock and drop skb. */ | |
65 | inet_twsk_put(tw); | |
66 | return TCP_TW_SUCCESS; | |
67 | } | |
68 | ||
e905a9ed | 69 | /* |
1da177e4 LT |
70 | * * Main purpose of TIME-WAIT state is to close connection gracefully, |
71 | * when one of ends sits in LAST-ACK or CLOSING retransmitting FIN | |
72 | * (and, probably, tail of data) and one or more our ACKs are lost. | |
73 | * * What is TIME-WAIT timeout? It is associated with maximal packet | |
74 | * lifetime in the internet, which results in wrong conclusion, that | |
75 | * it is set to catch "old duplicate segments" wandering out of their path. | |
76 | * It is not quite correct. This timeout is calculated so that it exceeds | |
77 | * maximal retransmission timeout enough to allow to lose one (or more) | |
78 | * segments sent by peer and our ACKs. This time may be calculated from RTO. | |
79 | * * When TIME-WAIT socket receives RST, it means that another end | |
80 | * finally closed and we are allowed to kill TIME-WAIT too. | |
81 | * * Second purpose of TIME-WAIT is catching old duplicate segments. | |
82 | * Well, certainly it is pure paranoia, but if we load TIME-WAIT | |
83 | * with this semantics, we MUST NOT kill TIME-WAIT state with RSTs. | |
84 | * * If we invented some more clever way to catch duplicates | |
85 | * (f.e. based on PAWS), we could truncate TIME-WAIT to several RTOs. | |
86 | * | |
87 | * The algorithm below is based on FORMAL INTERPRETATION of RFCs. | |
88 | * When you compare it to RFCs, please, read section SEGMENT ARRIVES | |
89 | * from the very beginning. | |
90 | * | |
91 | * NOTE. With recycling (and later with fin-wait-2) TW bucket | |
92 | * is _not_ stateless. It means, that strictly speaking we must | |
93 | * spinlock it. I do not want! Well, probability of misbehaviour | |
94 | * is ridiculously low and, seems, we could use some mb() tricks | |
95 | * to avoid misread sequence numbers, states etc. --ANK | |
4308fc58 AC |
96 | * |
97 | * We don't need to initialize tmp_out.sack_ok as we don't use the results | |
1da177e4 LT |
98 | */ |
99 | enum tcp_tw_status | |
8feaf0c0 ACM |
100 | tcp_timewait_state_process(struct inet_timewait_sock *tw, struct sk_buff *skb, |
101 | const struct tcphdr *th) | |
1da177e4 LT |
102 | { |
103 | struct tcp_options_received tmp_opt; | |
4957faad | 104 | struct tcp_timewait_sock *tcptw = tcp_twsk((struct sock *)tw); |
a2a385d6 | 105 | bool paws_reject = false; |
1da177e4 | 106 | |
bb5b7c11 | 107 | tmp_opt.saw_tstamp = 0; |
8feaf0c0 | 108 | if (th->doff > (sizeof(*th) >> 2) && tcptw->tw_ts_recent_stamp) { |
1a2c6181 | 109 | tcp_parse_options(skb, &tmp_opt, 0, NULL); |
1da177e4 LT |
110 | |
111 | if (tmp_opt.saw_tstamp) { | |
ee684b6f | 112 | tmp_opt.rcv_tsecr -= tcptw->tw_ts_offset; |
8feaf0c0 ACM |
113 | tmp_opt.ts_recent = tcptw->tw_ts_recent; |
114 | tmp_opt.ts_recent_stamp = tcptw->tw_ts_recent_stamp; | |
c887e6d2 | 115 | paws_reject = tcp_paws_reject(&tmp_opt, th->rst); |
1da177e4 LT |
116 | } |
117 | } | |
118 | ||
119 | if (tw->tw_substate == TCP_FIN_WAIT2) { | |
120 | /* Just repeat all the checks of tcp_rcv_state_process() */ | |
121 | ||
122 | /* Out of window, send ACK */ | |
123 | if (paws_reject || | |
124 | !tcp_in_window(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq, | |
8feaf0c0 ACM |
125 | tcptw->tw_rcv_nxt, |
126 | tcptw->tw_rcv_nxt + tcptw->tw_rcv_wnd)) | |
4fb17a60 NC |
127 | return tcp_timewait_check_oow_rate_limit( |
128 | tw, skb, LINUX_MIB_TCPACKSKIPPEDFINWAIT2); | |
1da177e4 LT |
129 | |
130 | if (th->rst) | |
131 | goto kill; | |
132 | ||
8feaf0c0 | 133 | if (th->syn && !before(TCP_SKB_CB(skb)->seq, tcptw->tw_rcv_nxt)) |
1da177e4 LT |
134 | goto kill_with_rst; |
135 | ||
136 | /* Dup ACK? */ | |
1ac530b3 WY |
137 | if (!th->ack || |
138 | !after(TCP_SKB_CB(skb)->end_seq, tcptw->tw_rcv_nxt) || | |
1da177e4 | 139 | TCP_SKB_CB(skb)->end_seq == TCP_SKB_CB(skb)->seq) { |
8feaf0c0 | 140 | inet_twsk_put(tw); |
1da177e4 LT |
141 | return TCP_TW_SUCCESS; |
142 | } | |
143 | ||
144 | /* New data or FIN. If new data arrive after half-duplex close, | |
145 | * reset. | |
146 | */ | |
147 | if (!th->fin || | |
8feaf0c0 | 148 | TCP_SKB_CB(skb)->end_seq != tcptw->tw_rcv_nxt + 1) { |
1da177e4 | 149 | kill_with_rst: |
789f558c | 150 | inet_twsk_deschedule(tw); |
8feaf0c0 | 151 | inet_twsk_put(tw); |
1da177e4 LT |
152 | return TCP_TW_RST; |
153 | } | |
154 | ||
155 | /* FIN arrived, enter true time-wait state. */ | |
8feaf0c0 ACM |
156 | tw->tw_substate = TCP_TIME_WAIT; |
157 | tcptw->tw_rcv_nxt = TCP_SKB_CB(skb)->end_seq; | |
1da177e4 | 158 | if (tmp_opt.saw_tstamp) { |
9d729f72 | 159 | tcptw->tw_ts_recent_stamp = get_seconds(); |
8feaf0c0 | 160 | tcptw->tw_ts_recent = tmp_opt.rcv_tsval; |
1da177e4 LT |
161 | } |
162 | ||
ccb7c410 DM |
163 | if (tcp_death_row.sysctl_tw_recycle && |
164 | tcptw->tw_ts_recent_stamp && | |
165 | tcp_tw_remember_stamp(tw)) | |
789f558c | 166 | inet_twsk_schedule(tw, tw->tw_timeout); |
1da177e4 | 167 | else |
789f558c | 168 | inet_twsk_schedule(tw, TCP_TIMEWAIT_LEN); |
1da177e4 LT |
169 | return TCP_TW_ACK; |
170 | } | |
171 | ||
172 | /* | |
173 | * Now real TIME-WAIT state. | |
174 | * | |
175 | * RFC 1122: | |
176 | * "When a connection is [...] on TIME-WAIT state [...] | |
177 | * [a TCP] MAY accept a new SYN from the remote TCP to | |
178 | * reopen the connection directly, if it: | |
e905a9ed | 179 | * |
1da177e4 LT |
180 | * (1) assigns its initial sequence number for the new |
181 | * connection to be larger than the largest sequence | |
182 | * number it used on the previous connection incarnation, | |
183 | * and | |
184 | * | |
e905a9ed | 185 | * (2) returns to TIME-WAIT state if the SYN turns out |
1da177e4 LT |
186 | * to be an old duplicate". |
187 | */ | |
188 | ||
189 | if (!paws_reject && | |
8feaf0c0 | 190 | (TCP_SKB_CB(skb)->seq == tcptw->tw_rcv_nxt && |
1da177e4 LT |
191 | (TCP_SKB_CB(skb)->seq == TCP_SKB_CB(skb)->end_seq || th->rst))) { |
192 | /* In window segment, it may be only reset or bare ack. */ | |
193 | ||
194 | if (th->rst) { | |
caa20d9a | 195 | /* This is TIME_WAIT assassination, in two flavors. |
1da177e4 LT |
196 | * Oh well... nobody has a sufficient solution to this |
197 | * protocol bug yet. | |
198 | */ | |
199 | if (sysctl_tcp_rfc1337 == 0) { | |
200 | kill: | |
789f558c | 201 | inet_twsk_deschedule(tw); |
8feaf0c0 | 202 | inet_twsk_put(tw); |
1da177e4 LT |
203 | return TCP_TW_SUCCESS; |
204 | } | |
205 | } | |
789f558c | 206 | inet_twsk_schedule(tw, TCP_TIMEWAIT_LEN); |
1da177e4 LT |
207 | |
208 | if (tmp_opt.saw_tstamp) { | |
8feaf0c0 | 209 | tcptw->tw_ts_recent = tmp_opt.rcv_tsval; |
9d729f72 | 210 | tcptw->tw_ts_recent_stamp = get_seconds(); |
1da177e4 LT |
211 | } |
212 | ||
8feaf0c0 | 213 | inet_twsk_put(tw); |
1da177e4 LT |
214 | return TCP_TW_SUCCESS; |
215 | } | |
216 | ||
217 | /* Out of window segment. | |
218 | ||
219 | All the segments are ACKed immediately. | |
220 | ||
221 | The only exception is new SYN. We accept it, if it is | |
222 | not old duplicate and we are not in danger to be killed | |
223 | by delayed old duplicates. RFC check is that it has | |
224 | newer sequence number works at rates <40Mbit/sec. | |
225 | However, if paws works, it is reliable AND even more, | |
226 | we even may relax silly seq space cutoff. | |
227 | ||
228 | RED-PEN: we violate main RFC requirement, if this SYN will appear | |
229 | old duplicate (i.e. we receive RST in reply to SYN-ACK), | |
230 | we must return socket to time-wait state. It is not good, | |
231 | but not fatal yet. | |
232 | */ | |
233 | ||
234 | if (th->syn && !th->rst && !th->ack && !paws_reject && | |
8feaf0c0 ACM |
235 | (after(TCP_SKB_CB(skb)->seq, tcptw->tw_rcv_nxt) || |
236 | (tmp_opt.saw_tstamp && | |
237 | (s32)(tcptw->tw_ts_recent - tmp_opt.rcv_tsval) < 0))) { | |
238 | u32 isn = tcptw->tw_snd_nxt + 65535 + 2; | |
1da177e4 LT |
239 | if (isn == 0) |
240 | isn++; | |
04317daf | 241 | TCP_SKB_CB(skb)->tcp_tw_isn = isn; |
1da177e4 LT |
242 | return TCP_TW_SYN; |
243 | } | |
244 | ||
245 | if (paws_reject) | |
de0744af | 246 | NET_INC_STATS_BH(twsk_net(tw), LINUX_MIB_PAWSESTABREJECTED); |
1da177e4 | 247 | |
2de979bd | 248 | if (!th->rst) { |
1da177e4 LT |
249 | /* In this case we must reset the TIMEWAIT timer. |
250 | * | |
251 | * If it is ACKless SYN it may be both old duplicate | |
252 | * and new good SYN with random sequence number <rcv_nxt. | |
253 | * Do not reschedule in the last case. | |
254 | */ | |
255 | if (paws_reject || th->ack) | |
789f558c | 256 | inet_twsk_schedule(tw, TCP_TIMEWAIT_LEN); |
1da177e4 | 257 | |
4fb17a60 NC |
258 | return tcp_timewait_check_oow_rate_limit( |
259 | tw, skb, LINUX_MIB_TCPACKSKIPPEDTIMEWAIT); | |
1da177e4 | 260 | } |
8feaf0c0 | 261 | inet_twsk_put(tw); |
1da177e4 LT |
262 | return TCP_TW_SUCCESS; |
263 | } | |
4bc2f18b | 264 | EXPORT_SYMBOL(tcp_timewait_state_process); |
1da177e4 | 265 | |
e905a9ed | 266 | /* |
1da177e4 | 267 | * Move a socket to time-wait or dead fin-wait-2 state. |
e905a9ed | 268 | */ |
1da177e4 LT |
269 | void tcp_time_wait(struct sock *sk, int state, int timeo) |
270 | { | |
8292a17a | 271 | const struct inet_connection_sock *icsk = inet_csk(sk); |
8feaf0c0 | 272 | const struct tcp_sock *tp = tcp_sk(sk); |
789f558c | 273 | struct inet_timewait_sock *tw; |
a2a385d6 | 274 | bool recycle_ok = false; |
1da177e4 | 275 | |
b6242b9b | 276 | if (tcp_death_row.sysctl_tw_recycle && tp->rx_opt.ts_recent_stamp) |
3f419d2d | 277 | recycle_ok = tcp_remember_stamp(sk); |
1da177e4 | 278 | |
789f558c | 279 | tw = inet_twsk_alloc(sk, &tcp_death_row, state); |
1da177e4 | 280 | |
00db4124 | 281 | if (tw) { |
8feaf0c0 | 282 | struct tcp_timewait_sock *tcptw = tcp_twsk((struct sock *)tw); |
463c84b9 | 283 | const int rto = (icsk->icsk_rto << 2) - (icsk->icsk_rto >> 1); |
2397849b | 284 | struct inet_sock *inet = inet_sk(sk); |
8feaf0c0 | 285 | |
2397849b | 286 | tw->tw_transparent = inet->transparent; |
1da177e4 | 287 | tw->tw_rcv_wscale = tp->rx_opt.rcv_wscale; |
8feaf0c0 ACM |
288 | tcptw->tw_rcv_nxt = tp->rcv_nxt; |
289 | tcptw->tw_snd_nxt = tp->snd_nxt; | |
290 | tcptw->tw_rcv_wnd = tcp_receive_window(tp); | |
291 | tcptw->tw_ts_recent = tp->rx_opt.ts_recent; | |
292 | tcptw->tw_ts_recent_stamp = tp->rx_opt.ts_recent_stamp; | |
ceaa1fef | 293 | tcptw->tw_ts_offset = tp->tsoffset; |
4fb17a60 | 294 | tcptw->tw_last_oow_ack_time = 0; |
1da177e4 | 295 | |
dfd56b8b | 296 | #if IS_ENABLED(CONFIG_IPV6) |
1da177e4 LT |
297 | if (tw->tw_family == PF_INET6) { |
298 | struct ipv6_pinfo *np = inet6_sk(sk); | |
299 | ||
efe4208f ED |
300 | tw->tw_v6_daddr = sk->sk_v6_daddr; |
301 | tw->tw_v6_rcv_saddr = sk->sk_v6_rcv_saddr; | |
b903d324 | 302 | tw->tw_tclass = np->tclass; |
1d13a96c | 303 | tw->tw_flowlabel = np->flow_label >> 12; |
9fe516ba | 304 | tw->tw_ipv6only = sk->sk_ipv6only; |
c676270b | 305 | } |
1da177e4 | 306 | #endif |
cfb6eeb4 YH |
307 | |
308 | #ifdef CONFIG_TCP_MD5SIG | |
309 | /* | |
310 | * The timewait bucket does not have the key DB from the | |
311 | * sock structure. We just make a quick copy of the | |
312 | * md5 key being used (if indeed we are using one) | |
313 | * so the timewait ack generating code has the key. | |
314 | */ | |
315 | do { | |
316 | struct tcp_md5sig_key *key; | |
a915da9b | 317 | tcptw->tw_md5_key = NULL; |
cfb6eeb4 | 318 | key = tp->af_specific->md5_lookup(sk, sk); |
00db4124 | 319 | if (key) { |
a915da9b | 320 | tcptw->tw_md5_key = kmemdup(key, sizeof(*key), GFP_ATOMIC); |
71cea17e | 321 | if (tcptw->tw_md5_key && !tcp_alloc_md5sig_pool()) |
cfb6eeb4 YH |
322 | BUG(); |
323 | } | |
2de979bd | 324 | } while (0); |
cfb6eeb4 YH |
325 | #endif |
326 | ||
1da177e4 | 327 | /* Linkage updates. */ |
e48c414e | 328 | __inet_twsk_hashdance(tw, sk, &tcp_hashinfo); |
1da177e4 LT |
329 | |
330 | /* Get the TIME_WAIT timeout firing. */ | |
331 | if (timeo < rto) | |
332 | timeo = rto; | |
333 | ||
334 | if (recycle_ok) { | |
335 | tw->tw_timeout = rto; | |
336 | } else { | |
337 | tw->tw_timeout = TCP_TIMEWAIT_LEN; | |
338 | if (state == TCP_TIME_WAIT) | |
339 | timeo = TCP_TIMEWAIT_LEN; | |
340 | } | |
341 | ||
789f558c | 342 | inet_twsk_schedule(tw, timeo); |
8feaf0c0 | 343 | inet_twsk_put(tw); |
1da177e4 LT |
344 | } else { |
345 | /* Sorry, if we're out of memory, just CLOSE this | |
346 | * socket up. We've got bigger problems than | |
347 | * non-graceful socket closings. | |
348 | */ | |
67631510 | 349 | NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPTIMEWAITOVERFLOW); |
1da177e4 LT |
350 | } |
351 | ||
352 | tcp_update_metrics(sk); | |
353 | tcp_done(sk); | |
354 | } | |
355 | ||
cfb6eeb4 YH |
356 | void tcp_twsk_destructor(struct sock *sk) |
357 | { | |
b6242b9b | 358 | #ifdef CONFIG_TCP_MD5SIG |
a928630a | 359 | struct tcp_timewait_sock *twsk = tcp_twsk(sk); |
2397849b | 360 | |
71cea17e | 361 | if (twsk->tw_md5_key) |
a915da9b | 362 | kfree_rcu(twsk->tw_md5_key, rcu); |
cfb6eeb4 YH |
363 | #endif |
364 | } | |
cfb6eeb4 YH |
365 | EXPORT_SYMBOL_GPL(tcp_twsk_destructor); |
366 | ||
843f4a55 YC |
367 | void tcp_openreq_init_rwin(struct request_sock *req, |
368 | struct sock *sk, struct dst_entry *dst) | |
369 | { | |
370 | struct inet_request_sock *ireq = inet_rsk(req); | |
371 | struct tcp_sock *tp = tcp_sk(sk); | |
372 | __u8 rcv_wscale; | |
373 | int mss = dst_metric_advmss(dst); | |
374 | ||
375 | if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < mss) | |
376 | mss = tp->rx_opt.user_mss; | |
377 | ||
378 | /* Set this up on the first call only */ | |
379 | req->window_clamp = tp->window_clamp ? : dst_metric(dst, RTAX_WINDOW); | |
380 | ||
381 | /* limit the window selection if the user enforce a smaller rx buffer */ | |
382 | if (sk->sk_userlocks & SOCK_RCVBUF_LOCK && | |
383 | (req->window_clamp > tcp_full_space(sk) || req->window_clamp == 0)) | |
384 | req->window_clamp = tcp_full_space(sk); | |
385 | ||
386 | /* tcp_full_space because it is guaranteed to be the first packet */ | |
387 | tcp_select_initial_window(tcp_full_space(sk), | |
388 | mss - (ireq->tstamp_ok ? TCPOLEN_TSTAMP_ALIGNED : 0), | |
389 | &req->rcv_wnd, | |
390 | &req->window_clamp, | |
391 | ireq->wscale_ok, | |
392 | &rcv_wscale, | |
393 | dst_metric(dst, RTAX_INITRWND)); | |
394 | ireq->rcv_wscale = rcv_wscale; | |
395 | } | |
396 | EXPORT_SYMBOL(tcp_openreq_init_rwin); | |
397 | ||
735d3831 FW |
398 | static void tcp_ecn_openreq_child(struct tcp_sock *tp, |
399 | const struct request_sock *req) | |
bdf1ee5d IJ |
400 | { |
401 | tp->ecn_flags = inet_rsk(req)->ecn_ok ? TCP_ECN_OK : 0; | |
402 | } | |
403 | ||
81164413 DB |
404 | void tcp_ca_openreq_child(struct sock *sk, const struct dst_entry *dst) |
405 | { | |
406 | struct inet_connection_sock *icsk = inet_csk(sk); | |
407 | u32 ca_key = dst_metric(dst, RTAX_CC_ALGO); | |
408 | bool ca_got_dst = false; | |
409 | ||
410 | if (ca_key != TCP_CA_UNSPEC) { | |
411 | const struct tcp_congestion_ops *ca; | |
412 | ||
413 | rcu_read_lock(); | |
414 | ca = tcp_ca_find_key(ca_key); | |
415 | if (likely(ca && try_module_get(ca->owner))) { | |
416 | icsk->icsk_ca_dst_locked = tcp_ca_dst_locked(dst); | |
417 | icsk->icsk_ca_ops = ca; | |
418 | ca_got_dst = true; | |
419 | } | |
420 | rcu_read_unlock(); | |
421 | } | |
422 | ||
423 | if (!ca_got_dst && !try_module_get(icsk->icsk_ca_ops->owner)) | |
424 | tcp_assign_congestion_control(sk); | |
425 | ||
426 | tcp_set_ca_state(sk, TCP_CA_Open); | |
427 | } | |
428 | EXPORT_SYMBOL_GPL(tcp_ca_openreq_child); | |
429 | ||
1da177e4 LT |
430 | /* This is not only more efficient than what we used to do, it eliminates |
431 | * a lot of code duplication between IPv4/IPv6 SYN recv processing. -DaveM | |
432 | * | |
433 | * Actually, we could lots of memory writes here. tp of listening | |
434 | * socket contains all necessary default parameters. | |
435 | */ | |
60236fdd | 436 | struct sock *tcp_create_openreq_child(struct sock *sk, struct request_sock *req, struct sk_buff *skb) |
1da177e4 | 437 | { |
e56c57d0 | 438 | struct sock *newsk = inet_csk_clone_lock(sk, req, GFP_ATOMIC); |
1da177e4 | 439 | |
00db4124 | 440 | if (newsk) { |
9f1d2604 | 441 | const struct inet_request_sock *ireq = inet_rsk(req); |
2e6599cb | 442 | struct tcp_request_sock *treq = tcp_rsk(req); |
a9948a7e | 443 | struct inet_connection_sock *newicsk = inet_csk(newsk); |
435cf559 | 444 | struct tcp_sock *newtp = tcp_sk(newsk); |
1da177e4 | 445 | |
1da177e4 | 446 | /* Now setup tcp_sock */ |
1da177e4 | 447 | newtp->pred_flags = 0; |
435cf559 WAS |
448 | |
449 | newtp->rcv_wup = newtp->copied_seq = | |
450 | newtp->rcv_nxt = treq->rcv_isn + 1; | |
451 | ||
452 | newtp->snd_sml = newtp->snd_una = | |
1a2c6181 | 453 | newtp->snd_nxt = newtp->snd_up = treq->snt_isn + 1; |
1da177e4 LT |
454 | |
455 | tcp_prequeue_init(newtp); | |
46d3ceab | 456 | INIT_LIST_HEAD(&newtp->tsq_node); |
1da177e4 | 457 | |
ee7537b6 | 458 | tcp_init_wl(newtp, treq->rcv_isn); |
1da177e4 | 459 | |
740b0f18 ED |
460 | newtp->srtt_us = 0; |
461 | newtp->mdev_us = jiffies_to_usecs(TCP_TIMEOUT_INIT); | |
463c84b9 | 462 | newicsk->icsk_rto = TCP_TIMEOUT_INIT; |
1da177e4 LT |
463 | |
464 | newtp->packets_out = 0; | |
1da177e4 LT |
465 | newtp->retrans_out = 0; |
466 | newtp->sacked_out = 0; | |
467 | newtp->fackets_out = 0; | |
0b6a05c1 | 468 | newtp->snd_ssthresh = TCP_INFINITE_SSTHRESH; |
eed530b6 | 469 | tcp_enable_early_retrans(newtp); |
9b717a8d | 470 | newtp->tlp_high_seq = 0; |
375fe02c | 471 | newtp->lsndtime = treq->snt_synack; |
f2b2c582 | 472 | newtp->last_oow_ack_time = 0; |
375fe02c | 473 | newtp->total_retrans = req->num_retrans; |
1da177e4 LT |
474 | |
475 | /* So many TCP implementations out there (incorrectly) count the | |
476 | * initial SYN frame in their delayed-ACK and congestion control | |
477 | * algorithms that we must have the following bandaid to talk | |
478 | * efficiently to them. -DaveM | |
479 | */ | |
9ad7c049 | 480 | newtp->snd_cwnd = TCP_INIT_CWND; |
1da177e4 LT |
481 | newtp->snd_cwnd_cnt = 0; |
482 | ||
1da177e4 | 483 | tcp_init_xmit_timers(newsk); |
996b175e | 484 | __skb_queue_head_init(&newtp->out_of_order_queue); |
1a2c6181 | 485 | newtp->write_seq = newtp->pushed_seq = treq->snt_isn + 1; |
1da177e4 LT |
486 | |
487 | newtp->rx_opt.saw_tstamp = 0; | |
488 | ||
489 | newtp->rx_opt.dsack = 0; | |
1da177e4 | 490 | newtp->rx_opt.num_sacks = 0; |
cabeccbd | 491 | |
1da177e4 | 492 | newtp->urg_data = 0; |
1da177e4 | 493 | |
1da177e4 | 494 | if (sock_flag(newsk, SOCK_KEEPOPEN)) |
463c84b9 ACM |
495 | inet_csk_reset_keepalive_timer(newsk, |
496 | keepalive_time_when(newtp)); | |
1da177e4 | 497 | |
2e6599cb | 498 | newtp->rx_opt.tstamp_ok = ireq->tstamp_ok; |
2de979bd | 499 | if ((newtp->rx_opt.sack_ok = ireq->sack_ok) != 0) { |
1da177e4 | 500 | if (sysctl_tcp_fack) |
e60402d0 | 501 | tcp_enable_fack(newtp); |
1da177e4 LT |
502 | } |
503 | newtp->window_clamp = req->window_clamp; | |
504 | newtp->rcv_ssthresh = req->rcv_wnd; | |
505 | newtp->rcv_wnd = req->rcv_wnd; | |
2e6599cb | 506 | newtp->rx_opt.wscale_ok = ireq->wscale_ok; |
1da177e4 | 507 | if (newtp->rx_opt.wscale_ok) { |
2e6599cb ACM |
508 | newtp->rx_opt.snd_wscale = ireq->snd_wscale; |
509 | newtp->rx_opt.rcv_wscale = ireq->rcv_wscale; | |
1da177e4 LT |
510 | } else { |
511 | newtp->rx_opt.snd_wscale = newtp->rx_opt.rcv_wscale = 0; | |
512 | newtp->window_clamp = min(newtp->window_clamp, 65535U); | |
513 | } | |
aa8223c7 ACM |
514 | newtp->snd_wnd = (ntohs(tcp_hdr(skb)->window) << |
515 | newtp->rx_opt.snd_wscale); | |
1da177e4 LT |
516 | newtp->max_window = newtp->snd_wnd; |
517 | ||
518 | if (newtp->rx_opt.tstamp_ok) { | |
519 | newtp->rx_opt.ts_recent = req->ts_recent; | |
9d729f72 | 520 | newtp->rx_opt.ts_recent_stamp = get_seconds(); |
1da177e4 LT |
521 | newtp->tcp_header_len = sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED; |
522 | } else { | |
523 | newtp->rx_opt.ts_recent_stamp = 0; | |
524 | newtp->tcp_header_len = sizeof(struct tcphdr); | |
525 | } | |
ceaa1fef | 526 | newtp->tsoffset = 0; |
cfb6eeb4 YH |
527 | #ifdef CONFIG_TCP_MD5SIG |
528 | newtp->md5sig_info = NULL; /*XXX*/ | |
529 | if (newtp->af_specific->md5_lookup(sk, newsk)) | |
530 | newtp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED; | |
531 | #endif | |
bee7ca9e | 532 | if (skb->len >= TCP_MSS_DEFAULT + newtp->tcp_header_len) |
463c84b9 | 533 | newicsk->icsk_ack.last_seg_size = skb->len - newtp->tcp_header_len; |
1da177e4 | 534 | newtp->rx_opt.mss_clamp = req->mss; |
735d3831 | 535 | tcp_ecn_openreq_child(newtp, req); |
8336886f | 536 | newtp->fastopen_rsk = NULL; |
6f73601e | 537 | newtp->syn_data_acked = 0; |
1da177e4 | 538 | |
63231bdd | 539 | TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_PASSIVEOPENS); |
1da177e4 LT |
540 | } |
541 | return newsk; | |
542 | } | |
4bc2f18b | 543 | EXPORT_SYMBOL(tcp_create_openreq_child); |
1da177e4 | 544 | |
e905a9ed | 545 | /* |
8336886f JC |
546 | * Process an incoming packet for SYN_RECV sockets represented as a |
547 | * request_sock. Normally sk is the listener socket but for TFO it | |
548 | * points to the child socket. | |
549 | * | |
550 | * XXX (TFO) - The current impl contains a special check for ack | |
551 | * validation and inside tcp_v4_reqsk_send_ack(). Can we do better? | |
4308fc58 AC |
552 | * |
553 | * We don't need to initialize tmp_opt.sack_ok as we don't use the results | |
1da177e4 LT |
554 | */ |
555 | ||
5a5f3a8d | 556 | struct sock *tcp_check_req(struct sock *sk, struct sk_buff *skb, |
60236fdd | 557 | struct request_sock *req, |
8336886f | 558 | bool fastopen) |
1da177e4 | 559 | { |
4957faad | 560 | struct tcp_options_received tmp_opt; |
4957faad | 561 | struct sock *child; |
aa8223c7 | 562 | const struct tcphdr *th = tcp_hdr(skb); |
714e85be | 563 | __be32 flg = tcp_flag_word(th) & (TCP_FLAG_RST|TCP_FLAG_SYN|TCP_FLAG_ACK); |
a2a385d6 | 564 | bool paws_reject = false; |
1da177e4 | 565 | |
8336886f JC |
566 | BUG_ON(fastopen == (sk->sk_state == TCP_LISTEN)); |
567 | ||
bb5b7c11 DM |
568 | tmp_opt.saw_tstamp = 0; |
569 | if (th->doff > (sizeof(struct tcphdr)>>2)) { | |
1a2c6181 | 570 | tcp_parse_options(skb, &tmp_opt, 0, NULL); |
1da177e4 LT |
571 | |
572 | if (tmp_opt.saw_tstamp) { | |
573 | tmp_opt.ts_recent = req->ts_recent; | |
574 | /* We do not store true stamp, but it is not required, | |
575 | * it can be estimated (approximately) | |
576 | * from another data. | |
577 | */ | |
e6c022a4 | 578 | tmp_opt.ts_recent_stamp = get_seconds() - ((TCP_TIMEOUT_INIT/HZ)<<req->num_timeout); |
c887e6d2 | 579 | paws_reject = tcp_paws_reject(&tmp_opt, th->rst); |
1da177e4 LT |
580 | } |
581 | } | |
582 | ||
583 | /* Check for pure retransmitted SYN. */ | |
2e6599cb | 584 | if (TCP_SKB_CB(skb)->seq == tcp_rsk(req)->rcv_isn && |
1da177e4 LT |
585 | flg == TCP_FLAG_SYN && |
586 | !paws_reject) { | |
587 | /* | |
588 | * RFC793 draws (Incorrectly! It was fixed in RFC1122) | |
589 | * this case on figure 6 and figure 8, but formal | |
590 | * protocol description says NOTHING. | |
591 | * To be more exact, it says that we should send ACK, | |
592 | * because this segment (at least, if it has no data) | |
593 | * is out of window. | |
594 | * | |
595 | * CONCLUSION: RFC793 (even with RFC1122) DOES NOT | |
596 | * describe SYN-RECV state. All the description | |
597 | * is wrong, we cannot believe to it and should | |
598 | * rely only on common sense and implementation | |
599 | * experience. | |
600 | * | |
601 | * Enforce "SYN-ACK" according to figure 8, figure 6 | |
602 | * of RFC793, fixed by RFC1122. | |
8336886f JC |
603 | * |
604 | * Note that even if there is new data in the SYN packet | |
605 | * they will be thrown away too. | |
cd75eff6 YC |
606 | * |
607 | * Reset timer after retransmitting SYNACK, similar to | |
608 | * the idea of fast retransmit in recovery. | |
1da177e4 | 609 | */ |
a9b2c06d NC |
610 | if (!tcp_oow_rate_limited(sock_net(sk), skb, |
611 | LINUX_MIB_TCPACKSKIPPEDSYNRECV, | |
612 | &tcp_rsk(req)->last_oow_ack_time) && | |
613 | ||
dd929c1b ED |
614 | !inet_rtx_syn_ack(sk, req)) { |
615 | unsigned long expires = jiffies; | |
616 | ||
617 | expires += min(TCP_TIMEOUT_INIT << req->num_timeout, | |
618 | TCP_RTO_MAX); | |
619 | if (!fastopen) | |
620 | mod_timer_pending(&req->rsk_timer, expires); | |
621 | else | |
622 | req->rsk_timer.expires = expires; | |
623 | } | |
1da177e4 LT |
624 | return NULL; |
625 | } | |
626 | ||
627 | /* Further reproduces section "SEGMENT ARRIVES" | |
628 | for state SYN-RECEIVED of RFC793. | |
629 | It is broken, however, it does not work only | |
630 | when SYNs are crossed. | |
631 | ||
632 | You would think that SYN crossing is impossible here, since | |
633 | we should have a SYN_SENT socket (from connect()) on our end, | |
634 | but this is not true if the crossed SYNs were sent to both | |
635 | ends by a malicious third party. We must defend against this, | |
636 | and to do that we first verify the ACK (as per RFC793, page | |
637 | 36) and reset if it is invalid. Is this a true full defense? | |
638 | To convince ourselves, let us consider a way in which the ACK | |
639 | test can still pass in this 'malicious crossed SYNs' case. | |
640 | Malicious sender sends identical SYNs (and thus identical sequence | |
641 | numbers) to both A and B: | |
642 | ||
643 | A: gets SYN, seq=7 | |
644 | B: gets SYN, seq=7 | |
645 | ||
646 | By our good fortune, both A and B select the same initial | |
647 | send sequence number of seven :-) | |
648 | ||
649 | A: sends SYN|ACK, seq=7, ack_seq=8 | |
650 | B: sends SYN|ACK, seq=7, ack_seq=8 | |
651 | ||
652 | So we are now A eating this SYN|ACK, ACK test passes. So | |
653 | does sequence test, SYN is truncated, and thus we consider | |
654 | it a bare ACK. | |
655 | ||
ec0a1966 DM |
656 | If icsk->icsk_accept_queue.rskq_defer_accept, we silently drop this |
657 | bare ACK. Otherwise, we create an established connection. Both | |
658 | ends (listening sockets) accept the new incoming connection and try | |
659 | to talk to each other. 8-) | |
1da177e4 LT |
660 | |
661 | Note: This case is both harmless, and rare. Possibility is about the | |
662 | same as us discovering intelligent life on another plant tomorrow. | |
663 | ||
664 | But generally, we should (RFC lies!) to accept ACK | |
665 | from SYNACK both here and in tcp_rcv_state_process(). | |
666 | tcp_rcv_state_process() does not, hence, we do not too. | |
667 | ||
668 | Note that the case is absolutely generic: | |
669 | we cannot optimize anything here without | |
670 | violating protocol. All the checks must be made | |
671 | before attempt to create socket. | |
672 | */ | |
673 | ||
674 | /* RFC793 page 36: "If the connection is in any non-synchronized state ... | |
675 | * and the incoming segment acknowledges something not yet | |
caa20d9a | 676 | * sent (the segment carries an unacceptable ACK) ... |
1da177e4 LT |
677 | * a reset is sent." |
678 | * | |
8336886f JC |
679 | * Invalid ACK: reset will be sent by listening socket. |
680 | * Note that the ACK validity check for a Fast Open socket is done | |
681 | * elsewhere and is checked directly against the child socket rather | |
682 | * than req because user data may have been sent out. | |
1da177e4 | 683 | */ |
8336886f | 684 | if ((flg & TCP_FLAG_ACK) && !fastopen && |
435cf559 | 685 | (TCP_SKB_CB(skb)->ack_seq != |
1a2c6181 | 686 | tcp_rsk(req)->snt_isn + 1)) |
1da177e4 LT |
687 | return sk; |
688 | ||
689 | /* Also, it would be not so bad idea to check rcv_tsecr, which | |
690 | * is essentially ACK extension and too early or too late values | |
691 | * should cause reset in unsynchronized states. | |
692 | */ | |
693 | ||
694 | /* RFC793: "first check sequence number". */ | |
695 | ||
696 | if (paws_reject || !tcp_in_window(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq, | |
8336886f | 697 | tcp_rsk(req)->rcv_nxt, tcp_rsk(req)->rcv_nxt + req->rcv_wnd)) { |
1da177e4 LT |
698 | /* Out of window: send ACK and drop. */ |
699 | if (!(flg & TCP_FLAG_RST)) | |
6edafaaf | 700 | req->rsk_ops->send_ack(sk, skb, req); |
1da177e4 | 701 | if (paws_reject) |
de0744af | 702 | NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_PAWSESTABREJECTED); |
1da177e4 LT |
703 | return NULL; |
704 | } | |
705 | ||
706 | /* In sequence, PAWS is OK. */ | |
707 | ||
8336886f | 708 | if (tmp_opt.saw_tstamp && !after(TCP_SKB_CB(skb)->seq, tcp_rsk(req)->rcv_nxt)) |
2aaab9a0 | 709 | req->ts_recent = tmp_opt.rcv_tsval; |
1da177e4 | 710 | |
2aaab9a0 AL |
711 | if (TCP_SKB_CB(skb)->seq == tcp_rsk(req)->rcv_isn) { |
712 | /* Truncate SYN, it is out of window starting | |
713 | at tcp_rsk(req)->rcv_isn + 1. */ | |
714 | flg &= ~TCP_FLAG_SYN; | |
715 | } | |
1da177e4 | 716 | |
2aaab9a0 AL |
717 | /* RFC793: "second check the RST bit" and |
718 | * "fourth, check the SYN bit" | |
719 | */ | |
720 | if (flg & (TCP_FLAG_RST|TCP_FLAG_SYN)) { | |
721 | TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_ATTEMPTFAILS); | |
722 | goto embryonic_reset; | |
723 | } | |
1da177e4 | 724 | |
2aaab9a0 AL |
725 | /* ACK sequence verified above, just make sure ACK is |
726 | * set. If ACK not set, just silently drop the packet. | |
8336886f JC |
727 | * |
728 | * XXX (TFO) - if we ever allow "data after SYN", the | |
729 | * following check needs to be removed. | |
2aaab9a0 AL |
730 | */ |
731 | if (!(flg & TCP_FLAG_ACK)) | |
732 | return NULL; | |
ec0a1966 | 733 | |
8336886f JC |
734 | /* For Fast Open no more processing is needed (sk is the |
735 | * child socket). | |
736 | */ | |
737 | if (fastopen) | |
738 | return sk; | |
739 | ||
d1b99ba4 | 740 | /* While TCP_DEFER_ACCEPT is active, drop bare ACK. */ |
e6c022a4 | 741 | if (req->num_timeout < inet_csk(sk)->icsk_accept_queue.rskq_defer_accept && |
2aaab9a0 AL |
742 | TCP_SKB_CB(skb)->end_seq == tcp_rsk(req)->rcv_isn + 1) { |
743 | inet_rsk(req)->acked = 1; | |
907cdda5 | 744 | NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_TCPDEFERACCEPTDROP); |
2aaab9a0 AL |
745 | return NULL; |
746 | } | |
747 | ||
748 | /* OK, ACK is valid, create big socket and | |
749 | * feed this segment to it. It will repeat all | |
750 | * the tests. THIS SEGMENT MUST MOVE SOCKET TO | |
751 | * ESTABLISHED STATE. If it will be dropped after | |
752 | * socket is created, wait for troubles. | |
753 | */ | |
754 | child = inet_csk(sk)->icsk_af_ops->syn_recv_sock(sk, skb, req, NULL); | |
51456b29 | 755 | if (!child) |
2aaab9a0 | 756 | goto listen_overflow; |
1da177e4 | 757 | |
52452c54 | 758 | inet_csk_reqsk_queue_unlink(sk, req); |
2aaab9a0 | 759 | inet_csk_reqsk_queue_removed(sk, req); |
1da177e4 | 760 | |
2aaab9a0 AL |
761 | inet_csk_reqsk_queue_add(sk, req, child); |
762 | return child; | |
1da177e4 | 763 | |
2aaab9a0 AL |
764 | listen_overflow: |
765 | if (!sysctl_tcp_abort_on_overflow) { | |
766 | inet_rsk(req)->acked = 1; | |
767 | return NULL; | |
768 | } | |
1da177e4 | 769 | |
2aaab9a0 | 770 | embryonic_reset: |
8336886f JC |
771 | if (!(flg & TCP_FLAG_RST)) { |
772 | /* Received a bad SYN pkt - for TFO We try not to reset | |
773 | * the local connection unless it's really necessary to | |
774 | * avoid becoming vulnerable to outside attack aiming at | |
775 | * resetting legit local connections. | |
776 | */ | |
2aaab9a0 | 777 | req->rsk_ops->send_reset(sk, skb); |
8336886f JC |
778 | } else if (fastopen) { /* received a valid RST pkt */ |
779 | reqsk_fastopen_remove(sk, req, true); | |
780 | tcp_reset(sk); | |
781 | } | |
782 | if (!fastopen) { | |
52452c54 | 783 | inet_csk_reqsk_queue_drop(sk, req); |
8336886f JC |
784 | NET_INC_STATS_BH(sock_net(sk), LINUX_MIB_EMBRYONICRSTS); |
785 | } | |
2aaab9a0 | 786 | return NULL; |
1da177e4 | 787 | } |
4bc2f18b | 788 | EXPORT_SYMBOL(tcp_check_req); |
1da177e4 LT |
789 | |
790 | /* | |
791 | * Queue segment on the new socket if the new socket is active, | |
792 | * otherwise we just shortcircuit this and continue with | |
793 | * the new socket. | |
8336886f JC |
794 | * |
795 | * For the vast majority of cases child->sk_state will be TCP_SYN_RECV | |
796 | * when entering. But other states are possible due to a race condition | |
797 | * where after __inet_lookup_established() fails but before the listener | |
798 | * locked is obtained, other packets cause the same connection to | |
799 | * be created. | |
1da177e4 LT |
800 | */ |
801 | ||
802 | int tcp_child_process(struct sock *parent, struct sock *child, | |
803 | struct sk_buff *skb) | |
804 | { | |
805 | int ret = 0; | |
806 | int state = child->sk_state; | |
807 | ||
808 | if (!sock_owned_by_user(child)) { | |
aa8223c7 ACM |
809 | ret = tcp_rcv_state_process(child, skb, tcp_hdr(skb), |
810 | skb->len); | |
1da177e4 LT |
811 | /* Wakeup parent, send SIGIO */ |
812 | if (state == TCP_SYN_RECV && child->sk_state != state) | |
676d2369 | 813 | parent->sk_data_ready(parent); |
1da177e4 LT |
814 | } else { |
815 | /* Alas, it is possible again, because we do lookup | |
816 | * in main socket hash table and lock on listening | |
817 | * socket does not protect us more. | |
818 | */ | |
a3a858ff | 819 | __sk_add_backlog(child, skb); |
1da177e4 LT |
820 | } |
821 | ||
822 | bh_unlock_sock(child); | |
823 | sock_put(child); | |
824 | return ret; | |
825 | } | |
1da177e4 | 826 | EXPORT_SYMBOL(tcp_child_process); |