inet_timewait_sock.c 8.9 KB
Newer Older
1 2 3 4 5 6 7 8 9 10
/*
 * INET		An implementation of the TCP/IP protocol suite for the LINUX
 *		operating system.  INET is implemented using the  BSD Socket
 *		interface as the means of communication with the user level.
 *
 *		Generic TIME_WAIT sockets functions
 *
 *		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 16
#include <net/inet_hashtables.h>
#include <net/inet_timewait_sock.h>
17
#include <net/ip.h>
18

19

20 21 22 23 24 25 26 27
/**
 *	inet_twsk_bind_unhash - unhash a timewait socket from bind hash
 *	@tw: timewait socket
 *	@hashinfo: hashinfo pointer
 *
 *	unhash a timewait socket from bind hash, if hashed.
 *	bind hash lock must be held by caller.
 *	Returns 1 if caller should call inet_twsk_put() after lock release.
28
 */
29
void inet_twsk_bind_unhash(struct inet_timewait_sock *tw,
30 31 32 33 34
			  struct inet_hashinfo *hashinfo)
{
	struct inet_bind_bucket *tb = tw->tw_tb;

	if (!tb)
35
		return;
36 37 38 39

	__hlist_del(&tw->tw_bind_node);
	tw->tw_tb = NULL;
	inet_bind_bucket_destroy(hashinfo->bind_bucket_cachep, tb);
40
	__sock_put((struct sock *)tw);
41 42
}

43
/* Must be called with locally disabled BHs. */
44
static void inet_twsk_kill(struct inet_timewait_sock *tw)
45
{
46
	struct inet_hashinfo *hashinfo = tw->tw_dr->hashinfo;
47
	spinlock_t *lock = inet_ehash_lockp(hashinfo, tw->tw_hash);
48
	struct inet_bind_hashbucket *bhead;
49

50
	spin_lock(lock);
51
	sk_nulls_del_node_init_rcu((struct sock *)tw);
52
	spin_unlock(lock);
53 54

	/* Disassociate with bind bucket. */
55 56
	bhead = &hashinfo->bhash[inet_bhashfn(twsk_net(tw), tw->tw_num,
			hashinfo->bhash_size)];
57

58
	spin_lock(&bhead->lock);
59
	inet_twsk_bind_unhash(tw, hashinfo);
60
	spin_unlock(&bhead->lock);
61

62 63
	atomic_dec(&tw->tw_dr->tw_count);
	inet_twsk_put(tw);
64 65
}

E
Eric Dumazet 已提交
66
void inet_twsk_free(struct inet_timewait_sock *tw)
67
{
68 69
	struct module *owner = tw->tw_prot->owner;
	twsk_destructor((struct sock *)tw);
70
#ifdef SOCK_REFCNT_DEBUG
71
	pr_debug("%s timewait_sock %p released\n", tw->tw_prot->name, tw);
72
#endif
73 74 75 76 77 78 79 80
	kmem_cache_free(tw->tw_prot->twsk_prot->twsk_slab, tw);
	module_put(owner);
}

void inet_twsk_put(struct inet_timewait_sock *tw)
{
	if (atomic_dec_and_test(&tw->tw_refcnt))
		inet_twsk_free(tw);
81 82 83
}
EXPORT_SYMBOL_GPL(inet_twsk_put);

E
Eric Dumazet 已提交
84 85 86 87 88 89 90 91 92 93 94 95
static void inet_twsk_add_node_rcu(struct inet_timewait_sock *tw,
				   struct hlist_nulls_head *list)
{
	hlist_nulls_add_head_rcu(&tw->tw_node, list);
}

static void inet_twsk_add_bind_node(struct inet_timewait_sock *tw,
				    struct hlist_head *list)
{
	hlist_add_head(&tw->tw_bind_node, list);
}

96
/*
97
 * Enter the time wait state.
98 99 100 101 102 103 104
 * Essentially we whip up a timewait bucket, copy the relevant info into it
 * from the SK, and mess with hash chains and list linkage.
 */
void __inet_twsk_hashdance(struct inet_timewait_sock *tw, struct sock *sk,
			   struct inet_hashinfo *hashinfo)
{
	const struct inet_sock *inet = inet_sk(sk);
105
	const struct inet_connection_sock *icsk = inet_csk(sk);
106
	struct inet_ehash_bucket *ehead = inet_ehash_bucket(hashinfo, sk->sk_hash);
107
	spinlock_t *lock = inet_ehash_lockp(hashinfo, sk->sk_hash);
108 109 110 111 112
	struct inet_bind_hashbucket *bhead;
	/* Step 1: Put TW into bind hash. Original socket stays there too.
	   Note, that any socket with inet->num != 0 MUST be bound in
	   binding cache, even if it is closed.
	 */
E
Eric Dumazet 已提交
113
	bhead = &hashinfo->bhash[inet_bhashfn(twsk_net(tw), inet->inet_num,
114
			hashinfo->bhash_size)];
115
	spin_lock_bh(&bhead->lock);
116
	tw->tw_tb = icsk->icsk_bind_hash;
117
	WARN_ON(!icsk->icsk_bind_hash);
118 119 120
	inet_twsk_add_bind_node(tw, &tw->tw_tb->owners);
	spin_unlock(&bhead->lock);

121
	spin_lock(lock);
122

123
	/*
E
Eric Dumazet 已提交
124 125
	 * Step 2: Hash TW into tcp ehash chain.
	 * Notes :
126
	 * - tw_refcnt is set to 4 because :
E
Eric Dumazet 已提交
127 128
	 * - We have one reference from bhash chain.
	 * - We have one reference from ehash chain.
129 130
	 * - We have one reference from timer.
	 * - One reference for ourself (our caller will release it).
E
Eric Dumazet 已提交
131 132
	 * We can use atomic_set() because prior spin_lock()/spin_unlock()
	 * committed into memory all tw fields.
133
	 */
134
	atomic_set(&tw->tw_refcnt, 4);
E
Eric Dumazet 已提交
135
	inet_twsk_add_node_rcu(tw, &ehead->chain);
136

E
Eric Dumazet 已提交
137
	/* Step 3: Remove SK from hash chain */
138 139
	if (__sk_nulls_del_node_init_rcu(sk))
		sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
140

141
	spin_unlock_bh(lock);
142
}
143 144
EXPORT_SYMBOL_GPL(__inet_twsk_hashdance);

145
static void tw_timer_handler(unsigned long data)
146
{
147 148 149
	struct inet_timewait_sock *tw = (struct inet_timewait_sock *)data;

	if (tw->tw_kill)
150
		__NET_INC_STATS(twsk_net(tw), LINUX_MIB_TIMEWAITKILLED);
151
	else
152
		__NET_INC_STATS(twsk_net(tw), LINUX_MIB_TIMEWAITED);
153 154 155 156 157 158 159 160 161 162 163 164 165 166
	inet_twsk_kill(tw);
}

struct inet_timewait_sock *inet_twsk_alloc(const struct sock *sk,
					   struct inet_timewait_death_row *dr,
					   const int state)
{
	struct inet_timewait_sock *tw;

	if (atomic_read(&dr->tw_count) >= dr->sysctl_max_tw_buckets)
		return NULL;

	tw = kmem_cache_alloc(sk->sk_prot_creator->twsk_prot->twsk_slab,
			      GFP_ATOMIC);
167
	if (tw) {
168 169
		const struct inet_sock *inet = inet_sk(sk);

170 171
		kmemcheck_annotate_bitfield(tw, flags);

172
		tw->tw_dr	    = dr;
173
		/* Give us an identity. */
E
Eric Dumazet 已提交
174 175
		tw->tw_daddr	    = inet->inet_daddr;
		tw->tw_rcv_saddr    = inet->inet_rcv_saddr;
176
		tw->tw_bound_dev_if = sk->sk_bound_dev_if;
177
		tw->tw_tos	    = inet->tos;
E
Eric Dumazet 已提交
178
		tw->tw_num	    = inet->inet_num;
179 180
		tw->tw_state	    = TCP_TIME_WAIT;
		tw->tw_substate	    = state;
E
Eric Dumazet 已提交
181 182
		tw->tw_sport	    = inet->inet_sport;
		tw->tw_dport	    = inet->inet_dport;
183 184
		tw->tw_family	    = sk->sk_family;
		tw->tw_reuse	    = sk->sk_reuse;
185
		tw->tw_hash	    = sk->sk_hash;
186
		tw->tw_ipv6only	    = 0;
187
		tw->tw_transparent  = inet->transparent;
188
		tw->tw_prot	    = sk->sk_prot_creator;
E
Eric Dumazet 已提交
189
		atomic64_set(&tw->tw_cookie, atomic64_read(&sk->sk_cookie));
190
		twsk_net_set(tw, sock_net(sk));
191 192
		setup_pinned_timer(&tw->tw_timer, tw_timer_handler,
				   (unsigned long)tw);
E
Eric Dumazet 已提交
193 194 195 196 197 198
		/*
		 * Because we use RCU lookups, we should not set tw_refcnt
		 * to a non null value before everything is setup for this
		 * timewait socket.
		 */
		atomic_set(&tw->tw_refcnt, 0);
199

200
		__module_get(tw->tw_prot->owner);
201 202 203 204
	}

	return tw;
}
205 206 207 208 209 210
EXPORT_SYMBOL_GPL(inet_twsk_alloc);

/* These are always called from BH context.  See callers in
 * tcp_input.c to verify this.
 */

211 212 213 214 215
/* This is for handling early-kills of TIME_WAIT sockets.
 * Warning : consume reference.
 * Caller should not access tw anymore.
 */
void inet_twsk_deschedule_put(struct inet_timewait_sock *tw)
216
{
217 218
	if (del_timer_sync(&tw->tw_timer))
		inet_twsk_kill(tw);
219
	inet_twsk_put(tw);
220
}
221
EXPORT_SYMBOL(inet_twsk_deschedule_put);
222

223
void __inet_twsk_schedule(struct inet_timewait_sock *tw, int timeo, bool rearm)
224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249
{
	/* timeout := RTO * 3.5
	 *
	 * 3.5 = 1+2+0.5 to wait for two retransmits.
	 *
	 * RATIONALE: if FIN arrived and we entered TIME-WAIT state,
	 * our ACK acking that FIN can be lost. If N subsequent retransmitted
	 * FINs (or previous seqments) are lost (probability of such event
	 * is p^(N+1), where p is probability to lose single packet and
	 * time to detect the loss is about RTO*(2^N - 1) with exponential
	 * backoff). Normal timewait length is calculated so, that we
	 * waited at least for one retransmitted FIN (maximal RTO is 120sec).
	 * [ BTW Linux. following BSD, violates this requirement waiting
	 *   only for 60sec, we should wait at least for 240 secs.
	 *   Well, 240 consumes too much of resources 8)
	 * ]
	 * This interval is not reduced to catch old duplicate and
	 * responces to our wandering segments living for two MSLs.
	 * However, if we use PAWS to detect
	 * old duplicates, we can reduce the interval to bounds required
	 * by RTO, rather than MSL. So, if peer understands PAWS, we
	 * kill tw bucket after 3.5*RTO (it is important that this number
	 * is greater than TS tick!) and detect old duplicates with help
	 * of PAWS.
	 */

250
	tw->tw_kill = timeo <= 4*HZ;
251
	if (!rearm) {
252
		BUG_ON(mod_timer(&tw->tw_timer, jiffies + timeo));
253
		atomic_inc(&tw->tw_dr->tw_count);
254 255
	} else {
		mod_timer_pending(&tw->tw_timer, jiffies + timeo);
256 257
	}
}
258
EXPORT_SYMBOL_GPL(__inet_twsk_schedule);
259

260
void inet_twsk_purge(struct inet_hashinfo *hashinfo, int family)
261 262 263
{
	struct inet_timewait_sock *tw;
	struct sock *sk;
264
	struct hlist_nulls_node *node;
265
	unsigned int slot;
266

267 268 269
	for (slot = 0; slot <= hashinfo->ehash_mask; slot++) {
		struct inet_ehash_bucket *head = &hashinfo->ehash[slot];
restart_rcu:
270
		cond_resched();
271
		rcu_read_lock();
272
restart:
E
Eric Dumazet 已提交
273 274 275
		sk_nulls_for_each_rcu(sk, node, &head->chain) {
			if (sk->sk_state != TCP_TIME_WAIT)
				continue;
276
			tw = inet_twsk(sk);
E
Eric W. Biederman 已提交
277 278
			if ((tw->tw_family != family) ||
				atomic_read(&twsk_net(tw)->count))
279 280
				continue;

281 282 283
			if (unlikely(!atomic_inc_not_zero(&tw->tw_refcnt)))
				continue;

E
Eric W. Biederman 已提交
284 285
			if (unlikely((tw->tw_family != family) ||
				     atomic_read(&twsk_net(tw)->count))) {
286 287 288 289 290
				inet_twsk_put(tw);
				goto restart;
			}

			rcu_read_unlock();
E
Eric Dumazet 已提交
291
			local_bh_disable();
292
			inet_twsk_deschedule_put(tw);
E
Eric Dumazet 已提交
293
			local_bh_enable();
294
			goto restart_rcu;
295
		}
296 297 298 299 300 301 302
		/* If the nulls value we got at the end of this lookup is
		 * not the expected one, we must restart lookup.
		 * We probably met an item that was moved to another chain.
		 */
		if (get_nulls_value(node) != slot)
			goto restart;
		rcu_read_unlock();
303 304 305
	}
}
EXPORT_SYMBOL_GPL(inet_twsk_purge);