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.
6 * Implementation of the Transmission Control Protocol(TCP).
8 * Version: $Id: tcp_minisocks.c,v 1.15 2002/02/01 22:01:04 davem Exp $
10 * Authors: Ross Biro, <bir7@leland.Stanford.Edu>
11 * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
12 * Mark Evans, <evansmp@uhura.aston.ac.uk>
13 * Corey Minyard <wf-rch!minyard@relay.EU.net>
14 * Florian La Roche, <flla@stud.uni-sb.de>
15 * Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
16 * Linus Torvalds, <torvalds@cs.helsinki.fi>
17 * Alan Cox, <gw4pts@gw4pts.ampr.org>
18 * Matthew Dillon, <dillon@apollo.west.oic.com>
19 * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
20 * Jorge Cwik, <jorge@laser.satlink.net>
23 #include <linux/config.h>
25 #include <linux/module.h>
26 #include <linux/sysctl.h>
27 #include <linux/workqueue.h>
29 #include <net/inet_common.h>
33 #define SYNC_INIT 0 /* let the user enable it */
38 int sysctl_tcp_tw_recycle;
39 int sysctl_tcp_max_tw_buckets = NR_FILE*2;
41 int sysctl_tcp_syncookies = SYNC_INIT;
42 int sysctl_tcp_abort_on_overflow;
44 static __inline__ int tcp_in_window(u32 seq, u32 end_seq, u32 s_win, u32 e_win)
48 if (after(end_seq, s_win) && before(seq, e_win))
50 return (seq == e_win && seq == end_seq);
53 /* New-style handling of TIME_WAIT sockets. */
58 /* Must be called with locally disabled BHs. */
59 static void tcp_timewait_kill(struct tcp_tw_bucket *tw)
61 struct tcp_ehash_bucket *ehead;
62 struct tcp_bind_hashbucket *bhead;
63 struct tcp_bind_bucket *tb;
65 /* Unlink from established hashes. */
66 ehead = &tcp_ehash[tw->tw_hashent];
67 write_lock(&ehead->lock);
68 if (hlist_unhashed(&tw->tw_node)) {
69 write_unlock(&ehead->lock);
72 __hlist_del(&tw->tw_node);
73 sk_node_init(&tw->tw_node);
74 write_unlock(&ehead->lock);
76 /* Disassociate with bind bucket. */
77 bhead = &tcp_bhash[tcp_bhashfn(tw->tw_num)];
78 spin_lock(&bhead->lock);
80 __hlist_del(&tw->tw_bind_node);
82 tcp_bucket_destroy(tb);
83 spin_unlock(&bhead->lock);
85 #ifdef INET_REFCNT_DEBUG
86 if (atomic_read(&tw->tw_refcnt) != 1) {
87 printk(KERN_DEBUG "tw_bucket %p refcnt=%d\n", tw,
88 atomic_read(&tw->tw_refcnt));
95 * * Main purpose of TIME-WAIT state is to close connection gracefully,
96 * when one of ends sits in LAST-ACK or CLOSING retransmitting FIN
97 * (and, probably, tail of data) and one or more our ACKs are lost.
98 * * What is TIME-WAIT timeout? It is associated with maximal packet
99 * lifetime in the internet, which results in wrong conclusion, that
100 * it is set to catch "old duplicate segments" wandering out of their path.
101 * It is not quite correct. This timeout is calculated so that it exceeds
102 * maximal retransmission timeout enough to allow to lose one (or more)
103 * segments sent by peer and our ACKs. This time may be calculated from RTO.
104 * * When TIME-WAIT socket receives RST, it means that another end
105 * finally closed and we are allowed to kill TIME-WAIT too.
106 * * Second purpose of TIME-WAIT is catching old duplicate segments.
107 * Well, certainly it is pure paranoia, but if we load TIME-WAIT
108 * with this semantics, we MUST NOT kill TIME-WAIT state with RSTs.
109 * * If we invented some more clever way to catch duplicates
110 * (f.e. based on PAWS), we could truncate TIME-WAIT to several RTOs.
112 * The algorithm below is based on FORMAL INTERPRETATION of RFCs.
113 * When you compare it to RFCs, please, read section SEGMENT ARRIVES
114 * from the very beginning.
116 * NOTE. With recycling (and later with fin-wait-2) TW bucket
117 * is _not_ stateless. It means, that strictly speaking we must
118 * spinlock it. I do not want! Well, probability of misbehaviour
119 * is ridiculously low and, seems, we could use some mb() tricks
120 * to avoid misread sequence numbers, states etc. --ANK
123 tcp_timewait_state_process(struct tcp_tw_bucket *tw, struct sk_buff *skb,
124 struct tcphdr *th, unsigned len)
130 if (th->doff > (sizeof(struct tcphdr) >> 2) && tw->tw_ts_recent_stamp) {
131 tcp_parse_options(skb, &tp, 0);
134 tp.ts_recent = tw->tw_ts_recent;
135 tp.ts_recent_stamp = tw->tw_ts_recent_stamp;
136 paws_reject = tcp_paws_check(&tp, th->rst);
140 if (tw->tw_substate == TCP_FIN_WAIT2) {
141 /* Just repeat all the checks of tcp_rcv_state_process() */
143 /* Out of window, send ACK */
145 !tcp_in_window(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq,
147 tw->tw_rcv_nxt + tw->tw_rcv_wnd))
153 if (th->syn && !before(TCP_SKB_CB(skb)->seq, tw->tw_rcv_nxt))
157 if (!after(TCP_SKB_CB(skb)->end_seq, tw->tw_rcv_nxt) ||
158 TCP_SKB_CB(skb)->end_seq == TCP_SKB_CB(skb)->seq) {
160 return TCP_TW_SUCCESS;
163 /* New data or FIN. If new data arrive after half-duplex close,
167 TCP_SKB_CB(skb)->end_seq != tw->tw_rcv_nxt + 1) {
169 tcp_tw_deschedule(tw);
174 /* FIN arrived, enter true time-wait state. */
175 tw->tw_substate = TCP_TIME_WAIT;
176 tw->tw_rcv_nxt = TCP_SKB_CB(skb)->end_seq;
178 tw->tw_ts_recent_stamp = xtime.tv_sec;
179 tw->tw_ts_recent = tp.rcv_tsval;
182 /* I am shamed, but failed to make it more elegant.
183 * Yes, it is direct reference to IP, which is impossible
184 * to generalize to IPv6. Taking into account that IPv6
185 * do not undertsnad recycling in any case, it not
186 * a big problem in practice. --ANK */
187 if (tw->tw_family == AF_INET &&
188 sysctl_tcp_tw_recycle && tw->tw_ts_recent_stamp &&
189 tcp_v4_tw_remember_stamp(tw))
190 tcp_tw_schedule(tw, tw->tw_timeout);
192 tcp_tw_schedule(tw, TCP_TIMEWAIT_LEN);
197 * Now real TIME-WAIT state.
200 * "When a connection is [...] on TIME-WAIT state [...]
201 * [a TCP] MAY accept a new SYN from the remote TCP to
202 * reopen the connection directly, if it:
204 * (1) assigns its initial sequence number for the new
205 * connection to be larger than the largest sequence
206 * number it used on the previous connection incarnation,
209 * (2) returns to TIME-WAIT state if the SYN turns out
210 * to be an old duplicate".
214 (TCP_SKB_CB(skb)->seq == tw->tw_rcv_nxt &&
215 (TCP_SKB_CB(skb)->seq == TCP_SKB_CB(skb)->end_seq || th->rst))) {
216 /* In window segment, it may be only reset or bare ack. */
219 /* This is TIME_WAIT assasination, in two flavors.
220 * Oh well... nobody has a sufficient solution to this
223 if (sysctl_tcp_rfc1337 == 0) {
225 tcp_tw_deschedule(tw);
227 return TCP_TW_SUCCESS;
230 tcp_tw_schedule(tw, TCP_TIMEWAIT_LEN);
233 tw->tw_ts_recent = tp.rcv_tsval;
234 tw->tw_ts_recent_stamp = xtime.tv_sec;
238 return TCP_TW_SUCCESS;
241 /* Out of window segment.
243 All the segments are ACKed immediately.
245 The only exception is new SYN. We accept it, if it is
246 not old duplicate and we are not in danger to be killed
247 by delayed old duplicates. RFC check is that it has
248 newer sequence number works at rates <40Mbit/sec.
249 However, if paws works, it is reliable AND even more,
250 we even may relax silly seq space cutoff.
252 RED-PEN: we violate main RFC requirement, if this SYN will appear
253 old duplicate (i.e. we receive RST in reply to SYN-ACK),
254 we must return socket to time-wait state. It is not good,
258 if (th->syn && !th->rst && !th->ack && !paws_reject &&
259 (after(TCP_SKB_CB(skb)->seq, tw->tw_rcv_nxt) ||
260 (tp.saw_tstamp && (s32)(tw->tw_ts_recent - tp.rcv_tsval) < 0))) {
261 u32 isn = tw->tw_snd_nxt + 65535 + 2;
264 TCP_SKB_CB(skb)->when = isn;
269 NET_INC_STATS_BH(PAWSEstabRejected);
272 /* In this case we must reset the TIMEWAIT timer.
274 * If it is ACKless SYN it may be both old duplicate
275 * and new good SYN with random sequence number <rcv_nxt.
276 * Do not reschedule in the last case.
278 if (paws_reject || th->ack)
279 tcp_tw_schedule(tw, TCP_TIMEWAIT_LEN);
281 /* Send ACK. Note, we do not put the bucket,
282 * it will be released by caller.
287 return TCP_TW_SUCCESS;
290 /* Enter the time wait state. This is called with locally disabled BH.
291 * Essentially we whip up a timewait bucket, copy the
292 * relevant info into it from the SK, and mess with hash chains
295 static void __tcp_tw_hashdance(struct sock *sk, struct tcp_tw_bucket *tw)
297 struct tcp_ehash_bucket *ehead = &tcp_ehash[sk->sk_hashent];
298 struct tcp_bind_hashbucket *bhead;
300 /* Step 1: Put TW into bind hash. Original socket stays there too.
301 Note, that any socket with inet_sk(sk)->num != 0 MUST be bound in
302 binding cache, even if it is closed.
304 bhead = &tcp_bhash[tcp_bhashfn(inet_sk(sk)->num)];
305 spin_lock(&bhead->lock);
306 tw->tw_tb = tcp_sk(sk)->bind_hash;
307 BUG_TRAP(tcp_sk(sk)->bind_hash);
308 tw_add_bind_node(tw, &tw->tw_tb->owners);
309 spin_unlock(&bhead->lock);
311 write_lock(&ehead->lock);
313 /* Step 2: Remove SK from established hash. */
314 if (__sk_del_node_init(sk))
315 sock_prot_dec_use(sk->sk_prot);
317 /* Step 3: Hash TW into TIMEWAIT half of established hash table. */
318 tw_add_node(tw, &(ehead + tcp_ehash_size)->chain);
319 atomic_inc(&tw->tw_refcnt);
321 write_unlock(&ehead->lock);
325 * Move a socket to time-wait or dead fin-wait-2 state.
327 void tcp_time_wait(struct sock *sk, int state, int timeo)
329 struct tcp_tw_bucket *tw = NULL;
330 struct tcp_opt *tp = tcp_sk(sk);
333 if (sysctl_tcp_tw_recycle && tp->ts_recent_stamp)
334 recycle_ok = tp->af_specific->remember_stamp(sk);
336 if (tcp_tw_count < sysctl_tcp_max_tw_buckets)
337 tw = kmem_cache_alloc(tcp_timewait_cachep, SLAB_ATOMIC);
340 struct inet_opt *inet = inet_sk(sk);
341 int rto = (tp->rto<<2) - (tp->rto>>1);
343 /* Give us an identity. */
344 tw->tw_daddr = inet->daddr;
345 tw->tw_rcv_saddr = inet->rcv_saddr;
346 tw->tw_bound_dev_if = sk->sk_bound_dev_if;
347 tw->tw_num = inet->num;
348 tw->tw_state = TCP_TIME_WAIT;
349 tw->tw_substate = state;
350 tw->tw_sport = inet->sport;
351 tw->tw_dport = inet->dport;
352 tw->tw_family = sk->sk_family;
353 tw->tw_reuse = sk->sk_reuse;
354 tw->tw_rcv_wscale = tp->rcv_wscale;
355 atomic_set(&tw->tw_refcnt, 1);
357 tw->tw_hashent = sk->sk_hashent;
358 tw->tw_rcv_nxt = tp->rcv_nxt;
359 tw->tw_snd_nxt = tp->snd_nxt;
360 tw->tw_rcv_wnd = tcp_receive_window(tp);
361 tw->tw_ts_recent = tp->ts_recent;
362 tw->tw_ts_recent_stamp = tp->ts_recent_stamp;
363 tw_dead_node_init(tw);
365 tw->tw_xid = sk->sk_xid;
366 tw->tw_vx_info = NULL;
367 tw->tw_nid = sk->sk_nid;
368 tw->tw_nx_info = NULL;
370 #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
371 if (tw->tw_family == PF_INET6) {
372 struct ipv6_pinfo *np = inet6_sk(sk);
374 ipv6_addr_copy(&tw->tw_v6_daddr, &np->daddr);
375 ipv6_addr_copy(&tw->tw_v6_rcv_saddr, &np->rcv_saddr);
376 tw->tw_v6_ipv6only = np->ipv6only;
378 memset(&tw->tw_v6_daddr, 0, sizeof(tw->tw_v6_daddr));
379 memset(&tw->tw_v6_rcv_saddr, 0, sizeof(tw->tw_v6_rcv_saddr));
380 tw->tw_v6_ipv6only = 0;
383 /* Linkage updates. */
384 __tcp_tw_hashdance(sk, tw);
386 /* Get the TIME_WAIT timeout firing. */
391 tw->tw_timeout = rto;
393 tw->tw_timeout = TCP_TIMEWAIT_LEN;
394 if (state == TCP_TIME_WAIT)
395 timeo = TCP_TIMEWAIT_LEN;
398 tcp_tw_schedule(tw, timeo);
401 /* Sorry, if we're out of memory, just CLOSE this
402 * socket up. We've got bigger problems than
403 * non-graceful socket closings.
406 printk(KERN_INFO "TCP: time wait bucket table overflow\n");
409 tcp_update_metrics(sk);
413 /* Kill off TIME_WAIT sockets once their lifetime has expired. */
414 static int tcp_tw_death_row_slot;
416 static void tcp_twkill(unsigned long);
418 /* TIME_WAIT reaping mechanism. */
419 #define TCP_TWKILL_SLOTS 8 /* Please keep this a power of 2. */
420 #define TCP_TWKILL_PERIOD (TCP_TIMEWAIT_LEN/TCP_TWKILL_SLOTS)
422 #define TCP_TWKILL_QUOTA 100
424 static struct hlist_head tcp_tw_death_row[TCP_TWKILL_SLOTS];
425 static spinlock_t tw_death_lock = SPIN_LOCK_UNLOCKED;
426 static struct timer_list tcp_tw_timer = TIMER_INITIALIZER(tcp_twkill, 0, 0);
427 static void twkill_work(void *);
428 static DECLARE_WORK(tcp_twkill_work, twkill_work, NULL);
429 static u32 twkill_thread_slots;
431 /* Returns non-zero if quota exceeded. */
432 static int tcp_do_twkill_work(int slot, unsigned int quota)
434 struct tcp_tw_bucket *tw;
435 struct hlist_node *node;
439 /* NOTE: compare this to previous version where lock
440 * was released after detaching chain. It was racy,
441 * because tw buckets are scheduled in not serialized context
442 * in 2.3 (with netfilter), and with softnet it is common, because
443 * soft irqs are not sequenced.
448 tw_for_each_inmate(tw, node, &tcp_tw_death_row[slot]) {
449 __tw_del_dead_node(tw);
450 spin_unlock(&tw_death_lock);
451 tcp_timewait_kill(tw);
454 spin_lock(&tw_death_lock);
455 if (killed > quota) {
460 /* While we dropped tw_death_lock, another cpu may have
461 * killed off the next TW bucket in the list, therefore
462 * do a fresh re-read of the hlist head node with the
463 * lock reacquired. We still use the hlist traversal
464 * macro in order to get the prefetches.
469 tcp_tw_count -= killed;
470 NET_ADD_STATS_BH(TimeWaited, killed);
475 static void tcp_twkill(unsigned long dummy)
479 spin_lock(&tw_death_lock);
481 if (tcp_tw_count == 0)
485 ret = tcp_do_twkill_work(tcp_tw_death_row_slot, TCP_TWKILL_QUOTA);
487 twkill_thread_slots |= (1 << tcp_tw_death_row_slot);
489 schedule_work(&tcp_twkill_work);
492 /* We purged the entire slot, anything left? */
496 tcp_tw_death_row_slot =
497 ((tcp_tw_death_row_slot + 1) & (TCP_TWKILL_SLOTS - 1));
499 mod_timer(&tcp_tw_timer, jiffies + TCP_TWKILL_PERIOD);
501 spin_unlock(&tw_death_lock);
504 extern void twkill_slots_invalid(void);
506 static void twkill_work(void *dummy)
510 if ((TCP_TWKILL_SLOTS - 1) > (sizeof(twkill_thread_slots) * 8))
511 twkill_slots_invalid();
513 while (twkill_thread_slots) {
514 spin_lock_bh(&tw_death_lock);
515 for (i = 0; i < TCP_TWKILL_SLOTS; i++) {
516 if (!(twkill_thread_slots & (1 << i)))
519 while (tcp_do_twkill_work(i, TCP_TWKILL_QUOTA) != 0) {
520 if (need_resched()) {
521 spin_unlock_bh(&tw_death_lock);
523 spin_lock_bh(&tw_death_lock);
527 twkill_thread_slots &= ~(1 << i);
529 spin_unlock_bh(&tw_death_lock);
533 /* These are always called from BH context. See callers in
534 * tcp_input.c to verify this.
537 /* This is for handling early-kills of TIME_WAIT sockets. */
538 void tcp_tw_deschedule(struct tcp_tw_bucket *tw)
540 spin_lock(&tw_death_lock);
541 if (tw_del_dead_node(tw)) {
543 if (--tcp_tw_count == 0)
544 del_timer(&tcp_tw_timer);
546 spin_unlock(&tw_death_lock);
547 tcp_timewait_kill(tw);
550 /* Short-time timewait calendar */
552 static int tcp_twcal_hand = -1;
553 static int tcp_twcal_jiffie;
554 static void tcp_twcal_tick(unsigned long);
555 static struct timer_list tcp_twcal_timer =
556 TIMER_INITIALIZER(tcp_twcal_tick, 0, 0);
557 static struct hlist_head tcp_twcal_row[TCP_TW_RECYCLE_SLOTS];
559 void tcp_tw_schedule(struct tcp_tw_bucket *tw, int timeo)
561 struct hlist_head *list;
564 /* timeout := RTO * 3.5
566 * 3.5 = 1+2+0.5 to wait for two retransmits.
568 * RATIONALE: if FIN arrived and we entered TIME-WAIT state,
569 * our ACK acking that FIN can be lost. If N subsequent retransmitted
570 * FINs (or previous seqments) are lost (probability of such event
571 * is p^(N+1), where p is probability to lose single packet and
572 * time to detect the loss is about RTO*(2^N - 1) with exponential
573 * backoff). Normal timewait length is calculated so, that we
574 * waited at least for one retransmitted FIN (maximal RTO is 120sec).
575 * [ BTW Linux. following BSD, violates this requirement waiting
576 * only for 60sec, we should wait at least for 240 secs.
577 * Well, 240 consumes too much of resources 8)
579 * This interval is not reduced to catch old duplicate and
580 * responces to our wandering segments living for two MSLs.
581 * However, if we use PAWS to detect
582 * old duplicates, we can reduce the interval to bounds required
583 * by RTO, rather than MSL. So, if peer understands PAWS, we
584 * kill tw bucket after 3.5*RTO (it is important that this number
585 * is greater than TS tick!) and detect old duplicates with help
588 slot = (timeo + (1<<TCP_TW_RECYCLE_TICK) - 1) >> TCP_TW_RECYCLE_TICK;
590 spin_lock(&tw_death_lock);
592 /* Unlink it, if it was scheduled */
593 if (tw_del_dead_node(tw))
596 atomic_inc(&tw->tw_refcnt);
598 if (slot >= TCP_TW_RECYCLE_SLOTS) {
599 /* Schedule to slow timer */
600 if (timeo >= TCP_TIMEWAIT_LEN) {
601 slot = TCP_TWKILL_SLOTS-1;
603 slot = (timeo + TCP_TWKILL_PERIOD-1) / TCP_TWKILL_PERIOD;
604 if (slot >= TCP_TWKILL_SLOTS)
605 slot = TCP_TWKILL_SLOTS-1;
607 tw->tw_ttd = jiffies + timeo;
608 slot = (tcp_tw_death_row_slot + slot) & (TCP_TWKILL_SLOTS - 1);
609 list = &tcp_tw_death_row[slot];
611 tw->tw_ttd = jiffies + (slot << TCP_TW_RECYCLE_TICK);
613 if (tcp_twcal_hand < 0) {
615 tcp_twcal_jiffie = jiffies;
616 tcp_twcal_timer.expires = tcp_twcal_jiffie + (slot<<TCP_TW_RECYCLE_TICK);
617 add_timer(&tcp_twcal_timer);
619 if (time_after(tcp_twcal_timer.expires, jiffies + (slot<<TCP_TW_RECYCLE_TICK)))
620 mod_timer(&tcp_twcal_timer, jiffies + (slot<<TCP_TW_RECYCLE_TICK));
621 slot = (tcp_twcal_hand + slot)&(TCP_TW_RECYCLE_SLOTS-1);
623 list = &tcp_twcal_row[slot];
626 hlist_add_head(&tw->tw_death_node, list);
628 if (tcp_tw_count++ == 0)
629 mod_timer(&tcp_tw_timer, jiffies+TCP_TWKILL_PERIOD);
630 spin_unlock(&tw_death_lock);
633 void tcp_twcal_tick(unsigned long dummy)
637 unsigned long now = jiffies;
641 spin_lock(&tw_death_lock);
642 if (tcp_twcal_hand < 0)
645 slot = tcp_twcal_hand;
646 j = tcp_twcal_jiffie;
648 for (n=0; n<TCP_TW_RECYCLE_SLOTS; n++) {
649 if (time_before_eq(j, now)) {
650 struct hlist_node *node, *safe;
651 struct tcp_tw_bucket *tw;
653 tw_for_each_inmate_safe(tw, node, safe,
654 &tcp_twcal_row[slot]) {
655 __tw_del_dead_node(tw);
656 tcp_timewait_kill(tw);
663 tcp_twcal_jiffie = j;
664 tcp_twcal_hand = slot;
667 if (!hlist_empty(&tcp_twcal_row[slot])) {
668 mod_timer(&tcp_twcal_timer, j);
672 j += (1<<TCP_TW_RECYCLE_TICK);
673 slot = (slot+1)&(TCP_TW_RECYCLE_SLOTS-1);
678 if ((tcp_tw_count -= killed) == 0)
679 del_timer(&tcp_tw_timer);
680 NET_ADD_STATS_BH(TimeWaitKilled, killed);
681 spin_unlock(&tw_death_lock);
684 /* This is not only more efficient than what we used to do, it eliminates
685 * a lot of code duplication between IPv4/IPv6 SYN recv processing. -DaveM
687 * Actually, we could lots of memory writes here. tp of listening
688 * socket contains all necessary default parameters.
690 struct sock *tcp_create_openreq_child(struct sock *sk, struct open_request *req, struct sk_buff *skb)
692 /* allocate the newsk from the same slab of the master sock,
693 * if not, at sk_free time we'll try to free it from the wrong
694 * slabcache (i.e. is it TCPv4 or v6?) -acme */
695 struct sock *newsk = sk_alloc(PF_INET, GFP_ATOMIC, 0, sk->sk_slab);
698 struct tcp_opt *newtp;
699 struct sk_filter *filter;
701 memcpy(newsk, sk, sizeof(struct tcp_sock));
702 newsk->sk_state = TCP_SYN_RECV;
707 sk_node_init(&newsk->sk_node);
708 tcp_sk(newsk)->bind_hash = NULL;
710 /* Clone the TCP header template */
711 inet_sk(newsk)->dport = req->rmt_port;
713 sock_lock_init(newsk);
716 newsk->sk_dst_lock = RW_LOCK_UNLOCKED;
717 atomic_set(&newsk->sk_rmem_alloc, 0);
718 skb_queue_head_init(&newsk->sk_receive_queue);
719 atomic_set(&newsk->sk_wmem_alloc, 0);
720 skb_queue_head_init(&newsk->sk_write_queue);
721 atomic_set(&newsk->sk_omem_alloc, 0);
722 newsk->sk_wmem_queued = 0;
723 newsk->sk_forward_alloc = 0;
725 sock_reset_flag(newsk, SOCK_DONE);
726 newsk->sk_userlocks = sk->sk_userlocks & ~SOCK_BINDPORT_LOCK;
727 newsk->sk_backlog.head = newsk->sk_backlog.tail = NULL;
728 newsk->sk_callback_lock = RW_LOCK_UNLOCKED;
729 skb_queue_head_init(&newsk->sk_error_queue);
730 newsk->sk_write_space = tcp_write_space;
732 if ((filter = newsk->sk_filter) != NULL)
733 sk_filter_charge(newsk, filter);
735 if (sk->sk_create_child)
736 sk->sk_create_child(sk, newsk);
738 if (unlikely(xfrm_sk_clone_policy(newsk))) {
739 /* It is still raw copy of parent, so invalidate
740 * destructor and make plain sk_free() */
741 newsk->sk_destruct = NULL;
746 /* Now setup tcp_opt */
747 newtp = tcp_sk(newsk);
748 newtp->pred_flags = 0;
749 newtp->rcv_nxt = req->rcv_isn + 1;
750 newtp->snd_nxt = req->snt_isn + 1;
751 newtp->snd_una = req->snt_isn + 1;
752 newtp->snd_sml = req->snt_isn + 1;
754 tcp_prequeue_init(newtp);
756 tcp_init_wl(newtp, req->snt_isn, req->rcv_isn);
758 newtp->retransmits = 0;
761 newtp->mdev = TCP_TIMEOUT_INIT;
762 newtp->rto = TCP_TIMEOUT_INIT;
764 newtp->packets_out = 0;
766 newtp->retrans_out = 0;
767 newtp->sacked_out = 0;
768 newtp->fackets_out = 0;
769 newtp->snd_ssthresh = 0x7fffffff;
771 /* So many TCP implementations out there (incorrectly) count the
772 * initial SYN frame in their delayed-ACK and congestion control
773 * algorithms that we must have the following bandaid to talk
774 * efficiently to them. -DaveM
777 newtp->snd_cwnd_cnt = 0;
779 newtp->bictcp.cnt = 0;
780 newtp->bictcp.last_max_cwnd = newtp->bictcp.last_cwnd = 0;
782 newtp->frto_counter = 0;
783 newtp->frto_highmark = 0;
785 tcp_set_ca_state(newtp, TCP_CA_Open);
786 tcp_init_xmit_timers(newsk);
787 skb_queue_head_init(&newtp->out_of_order_queue);
788 newtp->send_head = NULL;
789 newtp->rcv_wup = req->rcv_isn + 1;
790 newtp->write_seq = req->snt_isn + 1;
791 newtp->pushed_seq = newtp->write_seq;
792 newtp->copied_seq = req->rcv_isn + 1;
794 newtp->saw_tstamp = 0;
797 newtp->eff_sacks = 0;
799 newtp->probes_out = 0;
800 newtp->num_sacks = 0;
802 newtp->listen_opt = NULL;
803 newtp->accept_queue = newtp->accept_queue_tail = NULL;
804 /* Deinitialize syn_wait_lock to trap illegal accesses. */
805 memset(&newtp->syn_wait_lock, 0, sizeof(newtp->syn_wait_lock));
807 /* Back to base struct sock members. */
809 newsk->sk_priority = 0;
810 atomic_set(&newsk->sk_refcnt, 2);
812 /* hmm, maybe from socket? */
813 set_vx_info(&newsk->sk_vx_info, current->vx_info);
814 set_nx_info(&newsk->sk_nx_info, current->nx_info);
815 #ifdef INET_REFCNT_DEBUG
816 atomic_inc(&inet_sock_nr);
818 atomic_inc(&tcp_sockets_allocated);
820 if (sock_flag(newsk, SOCK_KEEPOPEN))
821 tcp_reset_keepalive_timer(newsk,
822 keepalive_time_when(newtp));
823 newsk->sk_socket = NULL;
824 newsk->sk_sleep = NULL;
825 newsk->sk_owner = NULL;
827 newtp->tstamp_ok = req->tstamp_ok;
828 if((newtp->sack_ok = req->sack_ok) != 0) {
832 newtp->window_clamp = req->window_clamp;
833 newtp->rcv_ssthresh = req->rcv_wnd;
834 newtp->rcv_wnd = req->rcv_wnd;
835 newtp->wscale_ok = req->wscale_ok;
836 if (newtp->wscale_ok) {
837 newtp->snd_wscale = req->snd_wscale;
838 newtp->rcv_wscale = req->rcv_wscale;
840 newtp->snd_wscale = newtp->rcv_wscale = 0;
841 newtp->window_clamp = min(newtp->window_clamp, 65535U);
843 newtp->snd_wnd = ntohs(skb->h.th->window) << newtp->snd_wscale;
844 newtp->max_window = newtp->snd_wnd;
846 if (newtp->tstamp_ok) {
847 newtp->ts_recent = req->ts_recent;
848 newtp->ts_recent_stamp = xtime.tv_sec;
849 newtp->tcp_header_len = sizeof(struct tcphdr) + TCPOLEN_TSTAMP_ALIGNED;
851 newtp->ts_recent_stamp = 0;
852 newtp->tcp_header_len = sizeof(struct tcphdr);
854 if (skb->len >= TCP_MIN_RCVMSS+newtp->tcp_header_len)
855 newtp->ack.last_seg_size = skb->len-newtp->tcp_header_len;
856 newtp->mss_clamp = req->mss;
857 TCP_ECN_openreq_child(newtp, req);
858 if (newtp->ecn_flags&TCP_ECN_OK)
859 newsk->sk_no_largesend = 1;
861 tcp_vegas_init(newtp);
862 TCP_INC_STATS_BH(TcpPassiveOpens);
868 * Process an incoming packet for SYN_RECV sockets represented
869 * as an open_request.
872 struct sock *tcp_check_req(struct sock *sk,struct sk_buff *skb,
873 struct open_request *req,
874 struct open_request **prev)
876 struct tcphdr *th = skb->h.th;
877 struct tcp_opt *tp = tcp_sk(sk);
878 u32 flg = tcp_flag_word(th) & (TCP_FLAG_RST|TCP_FLAG_SYN|TCP_FLAG_ACK);
884 if (th->doff > (sizeof(struct tcphdr)>>2)) {
885 tcp_parse_options(skb, &ttp, 0);
887 if (ttp.saw_tstamp) {
888 ttp.ts_recent = req->ts_recent;
889 /* We do not store true stamp, but it is not required,
890 * it can be estimated (approximately)
893 ttp.ts_recent_stamp = xtime.tv_sec - ((TCP_TIMEOUT_INIT/HZ)<<req->retrans);
894 paws_reject = tcp_paws_check(&ttp, th->rst);
898 /* Check for pure retransmitted SYN. */
899 if (TCP_SKB_CB(skb)->seq == req->rcv_isn &&
900 flg == TCP_FLAG_SYN &&
903 * RFC793 draws (Incorrectly! It was fixed in RFC1122)
904 * this case on figure 6 and figure 8, but formal
905 * protocol description says NOTHING.
906 * To be more exact, it says that we should send ACK,
907 * because this segment (at least, if it has no data)
910 * CONCLUSION: RFC793 (even with RFC1122) DOES NOT
911 * describe SYN-RECV state. All the description
912 * is wrong, we cannot believe to it and should
913 * rely only on common sense and implementation
916 * Enforce "SYN-ACK" according to figure 8, figure 6
917 * of RFC793, fixed by RFC1122.
919 req->class->rtx_syn_ack(sk, req, NULL);
923 /* Further reproduces section "SEGMENT ARRIVES"
924 for state SYN-RECEIVED of RFC793.
925 It is broken, however, it does not work only
926 when SYNs are crossed.
928 You would think that SYN crossing is impossible here, since
929 we should have a SYN_SENT socket (from connect()) on our end,
930 but this is not true if the crossed SYNs were sent to both
931 ends by a malicious third party. We must defend against this,
932 and to do that we first verify the ACK (as per RFC793, page
933 36) and reset if it is invalid. Is this a true full defense?
934 To convince ourselves, let us consider a way in which the ACK
935 test can still pass in this 'malicious crossed SYNs' case.
936 Malicious sender sends identical SYNs (and thus identical sequence
937 numbers) to both A and B:
942 By our good fortune, both A and B select the same initial
943 send sequence number of seven :-)
945 A: sends SYN|ACK, seq=7, ack_seq=8
946 B: sends SYN|ACK, seq=7, ack_seq=8
948 So we are now A eating this SYN|ACK, ACK test passes. So
949 does sequence test, SYN is truncated, and thus we consider
952 If tp->defer_accept, we silently drop this bare ACK. Otherwise,
953 we create an established connection. Both ends (listening sockets)
954 accept the new incoming connection and try to talk to each other. 8-)
956 Note: This case is both harmless, and rare. Possibility is about the
957 same as us discovering intelligent life on another plant tomorrow.
959 But generally, we should (RFC lies!) to accept ACK
960 from SYNACK both here and in tcp_rcv_state_process().
961 tcp_rcv_state_process() does not, hence, we do not too.
963 Note that the case is absolutely generic:
964 we cannot optimize anything here without
965 violating protocol. All the checks must be made
966 before attempt to create socket.
969 /* RFC793 page 36: "If the connection is in any non-synchronized state ...
970 * and the incoming segment acknowledges something not yet
971 * sent (the segment carries an unaccaptable ACK) ...
974 * Invalid ACK: reset will be sent by listening socket
976 if ((flg & TCP_FLAG_ACK) &&
977 (TCP_SKB_CB(skb)->ack_seq != req->snt_isn+1))
980 /* Also, it would be not so bad idea to check rcv_tsecr, which
981 * is essentially ACK extension and too early or too late values
982 * should cause reset in unsynchronized states.
985 /* RFC793: "first check sequence number". */
987 if (paws_reject || !tcp_in_window(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(skb)->end_seq,
988 req->rcv_isn+1, req->rcv_isn+1+req->rcv_wnd)) {
989 /* Out of window: send ACK and drop. */
990 if (!(flg & TCP_FLAG_RST))
991 req->class->send_ack(skb, req);
993 NET_INC_STATS_BH(PAWSEstabRejected);
997 /* In sequence, PAWS is OK. */
999 if (ttp.saw_tstamp && !after(TCP_SKB_CB(skb)->seq, req->rcv_isn+1))
1000 req->ts_recent = ttp.rcv_tsval;
1002 if (TCP_SKB_CB(skb)->seq == req->rcv_isn) {
1003 /* Truncate SYN, it is out of window starting
1004 at req->rcv_isn+1. */
1005 flg &= ~TCP_FLAG_SYN;
1008 /* RFC793: "second check the RST bit" and
1009 * "fourth, check the SYN bit"
1011 if (flg & (TCP_FLAG_RST|TCP_FLAG_SYN))
1012 goto embryonic_reset;
1014 /* ACK sequence verified above, just make sure ACK is
1015 * set. If ACK not set, just silently drop the packet.
1017 if (!(flg & TCP_FLAG_ACK))
1020 /* If TCP_DEFER_ACCEPT is set, drop bare ACK. */
1021 if (tp->defer_accept && TCP_SKB_CB(skb)->end_seq == req->rcv_isn+1) {
1026 /* OK, ACK is valid, create big socket and
1027 * feed this segment to it. It will repeat all
1028 * the tests. THIS SEGMENT MUST MOVE SOCKET TO
1029 * ESTABLISHED STATE. If it will be dropped after
1030 * socket is created, wait for troubles.
1032 child = tp->af_specific->syn_recv_sock(sk, skb, req, NULL);
1034 goto listen_overflow;
1036 sk_set_owner(child, sk->sk_owner);
1037 tcp_synq_unlink(tp, req, prev);
1038 tcp_synq_removed(sk, req);
1040 tcp_acceptq_queue(sk, req, child);
1044 if (!sysctl_tcp_abort_on_overflow) {
1050 NET_INC_STATS_BH(EmbryonicRsts);
1051 if (!(flg & TCP_FLAG_RST))
1052 req->class->send_reset(skb);
1054 tcp_synq_drop(sk, req, prev);
1059 * Queue segment on the new socket if the new socket is active,
1060 * otherwise we just shortcircuit this and continue with
1064 int tcp_child_process(struct sock *parent, struct sock *child,
1065 struct sk_buff *skb)
1068 int state = child->sk_state;
1070 if (!sock_owned_by_user(child)) {
1071 ret = tcp_rcv_state_process(child, skb, skb->h.th, skb->len);
1073 /* Wakeup parent, send SIGIO */
1074 if (state == TCP_SYN_RECV && child->sk_state != state)
1075 parent->sk_data_ready(parent, 0);
1077 /* Alas, it is possible again, because we do lookup
1078 * in main socket hash table and lock on listening
1079 * socket does not protect us more.
1081 sk_add_backlog(child, skb);
1084 bh_unlock_sock(child);
1089 EXPORT_SYMBOL(tcp_check_req);
1090 EXPORT_SYMBOL(tcp_child_process);
1091 EXPORT_SYMBOL(tcp_create_openreq_child);
1092 EXPORT_SYMBOL(tcp_timewait_state_process);
1093 EXPORT_SYMBOL(tcp_tw_deschedule);
1095 #ifdef CONFIG_SYSCTL
1096 EXPORT_SYMBOL(sysctl_tcp_tw_recycle);