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 * Generic TIME_WAIT sockets functions
8 * From code orinally in TCP
11 #include <linux/kernel.h>
12 #include <linux/kmemcheck.h>
13 #include <linux/slab.h>
14 #include <linux/module.h>
15 #include <net/inet_hashtables.h>
16 #include <net/inet_timewait_sock.h>
21 * inet_twsk_unhash - unhash a timewait socket from established hash
22 * @tw: timewait socket
24 * unhash a timewait socket from established hash, if hashed.
25 * ehash lock must be held by caller.
26 * Returns 1 if caller should call inet_twsk_put() after lock release.
28 int inet_twsk_unhash(struct inet_timewait_sock *tw)
30 if (hlist_nulls_unhashed(&tw->tw_node))
33 hlist_nulls_del_rcu(&tw->tw_node);
34 sk_nulls_node_init(&tw->tw_node);
36 * We cannot call inet_twsk_put() ourself under lock,
37 * caller must call it for us.
43 * inet_twsk_bind_unhash - unhash a timewait socket from bind hash
44 * @tw: timewait socket
45 * @hashinfo: hashinfo pointer
47 * unhash a timewait socket from bind hash, if hashed.
48 * bind hash lock must be held by caller.
49 * Returns 1 if caller should call inet_twsk_put() after lock release.
51 int inet_twsk_bind_unhash(struct inet_timewait_sock *tw,
52 struct inet_hashinfo *hashinfo)
54 struct inet_bind_bucket *tb = tw->tw_tb;
59 __hlist_del(&tw->tw_bind_node);
61 inet_bind_bucket_destroy(hashinfo->bind_bucket_cachep, tb);
63 * We cannot call inet_twsk_put() ourself under lock,
64 * caller must call it for us.
69 /* Must be called with locally disabled BHs. */
70 static void __inet_twsk_kill(struct inet_timewait_sock *tw,
71 struct inet_hashinfo *hashinfo)
73 struct inet_bind_hashbucket *bhead;
75 /* Unlink from established hashes. */
76 spinlock_t *lock = inet_ehash_lockp(hashinfo, tw->tw_hash);
79 refcnt = inet_twsk_unhash(tw);
82 /* Disassociate with bind bucket. */
83 bhead = &hashinfo->bhash[inet_bhashfn(twsk_net(tw), tw->tw_num,
84 hashinfo->bhash_size)];
86 spin_lock(&bhead->lock);
87 refcnt += inet_twsk_bind_unhash(tw, hashinfo);
88 spin_unlock(&bhead->lock);
90 #ifdef SOCK_REFCNT_DEBUG
91 if (atomic_read(&tw->tw_refcnt) != 1) {
92 printk(KERN_DEBUG "%s timewait_sock %p refcnt=%d\n",
93 tw->tw_prot->name, tw, atomic_read(&tw->tw_refcnt));
102 static noinline void inet_twsk_free(struct inet_timewait_sock *tw)
104 struct module *owner = tw->tw_prot->owner;
105 twsk_destructor((struct sock *)tw);
106 #ifdef SOCK_REFCNT_DEBUG
107 pr_debug("%s timewait_sock %p released\n", tw->tw_prot->name, tw);
109 release_net(twsk_net(tw));
110 kmem_cache_free(tw->tw_prot->twsk_prot->twsk_slab, tw);
114 void inet_twsk_put(struct inet_timewait_sock *tw)
116 if (atomic_dec_and_test(&tw->tw_refcnt))
119 EXPORT_SYMBOL_GPL(inet_twsk_put);
122 * Enter the time wait state. This is called with locally disabled BH.
123 * Essentially we whip up a timewait bucket, copy the relevant info into it
124 * from the SK, and mess with hash chains and list linkage.
126 void __inet_twsk_hashdance(struct inet_timewait_sock *tw, struct sock *sk,
127 struct inet_hashinfo *hashinfo)
129 const struct inet_sock *inet = inet_sk(sk);
130 const struct inet_connection_sock *icsk = inet_csk(sk);
131 struct inet_ehash_bucket *ehead = inet_ehash_bucket(hashinfo, sk->sk_hash);
132 spinlock_t *lock = inet_ehash_lockp(hashinfo, sk->sk_hash);
133 struct inet_bind_hashbucket *bhead;
134 /* Step 1: Put TW into bind hash. Original socket stays there too.
135 Note, that any socket with inet->num != 0 MUST be bound in
136 binding cache, even if it is closed.
138 bhead = &hashinfo->bhash[inet_bhashfn(twsk_net(tw), inet->inet_num,
139 hashinfo->bhash_size)];
140 spin_lock(&bhead->lock);
141 tw->tw_tb = icsk->icsk_bind_hash;
142 WARN_ON(!icsk->icsk_bind_hash);
143 inet_twsk_add_bind_node(tw, &tw->tw_tb->owners);
144 spin_unlock(&bhead->lock);
149 * Step 2: Hash TW into TIMEWAIT chain.
150 * Should be done before removing sk from established chain
151 * because readers are lockless and search established first.
153 inet_twsk_add_node_rcu(tw, &ehead->twchain);
155 /* Step 3: Remove SK from established hash. */
156 if (__sk_nulls_del_node_init_rcu(sk))
157 sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
161 * - We initially set tw_refcnt to 0 in inet_twsk_alloc()
162 * - We add one reference for the bhash link
163 * - We add one reference for the ehash link
164 * - We want this refcnt update done before allowing other
165 * threads to find this tw in ehash chain.
167 atomic_add(1 + 1 + 1, &tw->tw_refcnt);
171 EXPORT_SYMBOL_GPL(__inet_twsk_hashdance);
173 struct inet_timewait_sock *inet_twsk_alloc(const struct sock *sk, const int state)
175 struct inet_timewait_sock *tw =
176 kmem_cache_alloc(sk->sk_prot_creator->twsk_prot->twsk_slab,
179 const struct inet_sock *inet = inet_sk(sk);
181 kmemcheck_annotate_bitfield(tw, flags);
183 /* Give us an identity. */
184 tw->tw_daddr = inet->inet_daddr;
185 tw->tw_rcv_saddr = inet->inet_rcv_saddr;
186 tw->tw_bound_dev_if = sk->sk_bound_dev_if;
187 tw->tw_tos = inet->tos;
188 tw->tw_num = inet->inet_num;
189 tw->tw_state = TCP_TIME_WAIT;
190 tw->tw_substate = state;
191 tw->tw_sport = inet->inet_sport;
192 tw->tw_dport = inet->inet_dport;
193 tw->tw_family = sk->sk_family;
194 tw->tw_reuse = sk->sk_reuse;
195 tw->tw_hash = sk->sk_hash;
197 tw->tw_transparent = inet->transparent;
198 tw->tw_prot = sk->sk_prot_creator;
199 twsk_net_set(tw, hold_net(sock_net(sk)));
201 * Because we use RCU lookups, we should not set tw_refcnt
202 * to a non null value before everything is setup for this
205 atomic_set(&tw->tw_refcnt, 0);
206 inet_twsk_dead_node_init(tw);
207 __module_get(tw->tw_prot->owner);
212 EXPORT_SYMBOL_GPL(inet_twsk_alloc);
214 /* Returns non-zero if quota exceeded. */
215 static int inet_twdr_do_twkill_work(struct inet_timewait_death_row *twdr,
218 struct inet_timewait_sock *tw;
219 struct hlist_node *node;
223 /* NOTE: compare this to previous version where lock
224 * was released after detaching chain. It was racy,
225 * because tw buckets are scheduled in not serialized context
226 * in 2.3 (with netfilter), and with softnet it is common, because
227 * soft irqs are not sequenced.
232 inet_twsk_for_each_inmate(tw, node, &twdr->cells[slot]) {
233 __inet_twsk_del_dead_node(tw);
234 spin_unlock(&twdr->death_lock);
235 __inet_twsk_kill(tw, twdr->hashinfo);
237 NET_INC_STATS_BH(twsk_net(tw), LINUX_MIB_TIMEWAITED);
241 spin_lock(&twdr->death_lock);
242 if (killed > INET_TWDR_TWKILL_QUOTA) {
247 /* While we dropped twdr->death_lock, another cpu may have
248 * killed off the next TW bucket in the list, therefore
249 * do a fresh re-read of the hlist head node with the
250 * lock reacquired. We still use the hlist traversal
251 * macro in order to get the prefetches.
256 twdr->tw_count -= killed;
257 #ifndef CONFIG_NET_NS
258 NET_ADD_STATS_BH(&init_net, LINUX_MIB_TIMEWAITED, killed);
263 void inet_twdr_hangman(unsigned long data)
265 struct inet_timewait_death_row *twdr;
266 int unsigned need_timer;
268 twdr = (struct inet_timewait_death_row *)data;
269 spin_lock(&twdr->death_lock);
271 if (twdr->tw_count == 0)
275 if (inet_twdr_do_twkill_work(twdr, twdr->slot)) {
276 twdr->thread_slots |= (1 << twdr->slot);
277 schedule_work(&twdr->twkill_work);
280 /* We purged the entire slot, anything left? */
283 twdr->slot = ((twdr->slot + 1) & (INET_TWDR_TWKILL_SLOTS - 1));
286 mod_timer(&twdr->tw_timer, jiffies + twdr->period);
288 spin_unlock(&twdr->death_lock);
290 EXPORT_SYMBOL_GPL(inet_twdr_hangman);
292 void inet_twdr_twkill_work(struct work_struct *work)
294 struct inet_timewait_death_row *twdr =
295 container_of(work, struct inet_timewait_death_row, twkill_work);
298 BUILD_BUG_ON((INET_TWDR_TWKILL_SLOTS - 1) >
299 (sizeof(twdr->thread_slots) * 8));
301 while (twdr->thread_slots) {
302 spin_lock_bh(&twdr->death_lock);
303 for (i = 0; i < INET_TWDR_TWKILL_SLOTS; i++) {
304 if (!(twdr->thread_slots & (1 << i)))
307 while (inet_twdr_do_twkill_work(twdr, i) != 0) {
308 if (need_resched()) {
309 spin_unlock_bh(&twdr->death_lock);
311 spin_lock_bh(&twdr->death_lock);
315 twdr->thread_slots &= ~(1 << i);
317 spin_unlock_bh(&twdr->death_lock);
320 EXPORT_SYMBOL_GPL(inet_twdr_twkill_work);
322 /* These are always called from BH context. See callers in
323 * tcp_input.c to verify this.
326 /* This is for handling early-kills of TIME_WAIT sockets. */
327 void inet_twsk_deschedule(struct inet_timewait_sock *tw,
328 struct inet_timewait_death_row *twdr)
330 spin_lock(&twdr->death_lock);
331 if (inet_twsk_del_dead_node(tw)) {
333 if (--twdr->tw_count == 0)
334 del_timer(&twdr->tw_timer);
336 spin_unlock(&twdr->death_lock);
337 __inet_twsk_kill(tw, twdr->hashinfo);
339 EXPORT_SYMBOL(inet_twsk_deschedule);
341 void inet_twsk_schedule(struct inet_timewait_sock *tw,
342 struct inet_timewait_death_row *twdr,
343 const int timeo, const int timewait_len)
345 struct hlist_head *list;
348 /* timeout := RTO * 3.5
350 * 3.5 = 1+2+0.5 to wait for two retransmits.
352 * RATIONALE: if FIN arrived and we entered TIME-WAIT state,
353 * our ACK acking that FIN can be lost. If N subsequent retransmitted
354 * FINs (or previous seqments) are lost (probability of such event
355 * is p^(N+1), where p is probability to lose single packet and
356 * time to detect the loss is about RTO*(2^N - 1) with exponential
357 * backoff). Normal timewait length is calculated so, that we
358 * waited at least for one retransmitted FIN (maximal RTO is 120sec).
359 * [ BTW Linux. following BSD, violates this requirement waiting
360 * only for 60sec, we should wait at least for 240 secs.
361 * Well, 240 consumes too much of resources 8)
363 * This interval is not reduced to catch old duplicate and
364 * responces to our wandering segments living for two MSLs.
365 * However, if we use PAWS to detect
366 * old duplicates, we can reduce the interval to bounds required
367 * by RTO, rather than MSL. So, if peer understands PAWS, we
368 * kill tw bucket after 3.5*RTO (it is important that this number
369 * is greater than TS tick!) and detect old duplicates with help
372 slot = (timeo + (1 << INET_TWDR_RECYCLE_TICK) - 1) >> INET_TWDR_RECYCLE_TICK;
374 spin_lock(&twdr->death_lock);
376 /* Unlink it, if it was scheduled */
377 if (inet_twsk_del_dead_node(tw))
380 atomic_inc(&tw->tw_refcnt);
382 if (slot >= INET_TWDR_RECYCLE_SLOTS) {
383 /* Schedule to slow timer */
384 if (timeo >= timewait_len) {
385 slot = INET_TWDR_TWKILL_SLOTS - 1;
387 slot = DIV_ROUND_UP(timeo, twdr->period);
388 if (slot >= INET_TWDR_TWKILL_SLOTS)
389 slot = INET_TWDR_TWKILL_SLOTS - 1;
391 tw->tw_ttd = jiffies + timeo;
392 slot = (twdr->slot + slot) & (INET_TWDR_TWKILL_SLOTS - 1);
393 list = &twdr->cells[slot];
395 tw->tw_ttd = jiffies + (slot << INET_TWDR_RECYCLE_TICK);
397 if (twdr->twcal_hand < 0) {
398 twdr->twcal_hand = 0;
399 twdr->twcal_jiffie = jiffies;
400 twdr->twcal_timer.expires = twdr->twcal_jiffie +
401 (slot << INET_TWDR_RECYCLE_TICK);
402 add_timer(&twdr->twcal_timer);
404 if (time_after(twdr->twcal_timer.expires,
405 jiffies + (slot << INET_TWDR_RECYCLE_TICK)))
406 mod_timer(&twdr->twcal_timer,
407 jiffies + (slot << INET_TWDR_RECYCLE_TICK));
408 slot = (twdr->twcal_hand + slot) & (INET_TWDR_RECYCLE_SLOTS - 1);
410 list = &twdr->twcal_row[slot];
413 hlist_add_head(&tw->tw_death_node, list);
415 if (twdr->tw_count++ == 0)
416 mod_timer(&twdr->tw_timer, jiffies + twdr->period);
417 spin_unlock(&twdr->death_lock);
419 EXPORT_SYMBOL_GPL(inet_twsk_schedule);
421 void inet_twdr_twcal_tick(unsigned long data)
423 struct inet_timewait_death_row *twdr;
426 unsigned long now = jiffies;
430 twdr = (struct inet_timewait_death_row *)data;
432 spin_lock(&twdr->death_lock);
433 if (twdr->twcal_hand < 0)
436 slot = twdr->twcal_hand;
437 j = twdr->twcal_jiffie;
439 for (n = 0; n < INET_TWDR_RECYCLE_SLOTS; n++) {
440 if (time_before_eq(j, now)) {
441 struct hlist_node *node, *safe;
442 struct inet_timewait_sock *tw;
444 inet_twsk_for_each_inmate_safe(tw, node, safe,
445 &twdr->twcal_row[slot]) {
446 __inet_twsk_del_dead_node(tw);
447 __inet_twsk_kill(tw, twdr->hashinfo);
449 NET_INC_STATS_BH(twsk_net(tw), LINUX_MIB_TIMEWAITKILLED);
457 twdr->twcal_jiffie = j;
458 twdr->twcal_hand = slot;
461 if (!hlist_empty(&twdr->twcal_row[slot])) {
462 mod_timer(&twdr->twcal_timer, j);
466 j += 1 << INET_TWDR_RECYCLE_TICK;
467 slot = (slot + 1) & (INET_TWDR_RECYCLE_SLOTS - 1);
469 twdr->twcal_hand = -1;
472 if ((twdr->tw_count -= killed) == 0)
473 del_timer(&twdr->tw_timer);
474 #ifndef CONFIG_NET_NS
475 NET_ADD_STATS_BH(&init_net, LINUX_MIB_TIMEWAITKILLED, killed);
477 spin_unlock(&twdr->death_lock);
479 EXPORT_SYMBOL_GPL(inet_twdr_twcal_tick);
481 void inet_twsk_purge(struct inet_hashinfo *hashinfo,
482 struct inet_timewait_death_row *twdr, int family)
484 struct inet_timewait_sock *tw;
486 struct hlist_nulls_node *node;
489 for (slot = 0; slot <= hashinfo->ehash_mask; slot++) {
490 struct inet_ehash_bucket *head = &hashinfo->ehash[slot];
494 sk_nulls_for_each_rcu(sk, node, &head->twchain) {
496 if ((tw->tw_family != family) ||
497 atomic_read(&twsk_net(tw)->count))
500 if (unlikely(!atomic_inc_not_zero(&tw->tw_refcnt)))
503 if (unlikely((tw->tw_family != family) ||
504 atomic_read(&twsk_net(tw)->count))) {
511 inet_twsk_deschedule(tw, twdr);
516 /* If the nulls value we got at the end of this lookup is
517 * not the expected one, we must restart lookup.
518 * We probably met an item that was moved to another chain.
520 if (get_nulls_value(node) != slot)
525 EXPORT_SYMBOL_GPL(inet_twsk_purge);