inet_hashtables.h 12.6 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
/*
 * 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.
 *
 * Authors:	Lotsa people, from code originally in tcp
 *
 *	This program is free software; you can redistribute it and/or
 *      modify it under the terms of the GNU General Public License
 *      as published by the Free Software Foundation; either version
 *      2 of the License, or (at your option) any later version.
 */

#ifndef _INET_HASHTABLES_H
#define _INET_HASHTABLES_H

17

18
#include <linux/interrupt.h>
19
#include <linux/ip.h>
20
#include <linux/ipv6.h>
21 22
#include <linux/list.h>
#include <linux/slab.h>
23
#include <linux/socket.h>
24
#include <linux/spinlock.h>
25
#include <linux/types.h>
26
#include <linux/wait.h>
27
#include <linux/vmalloc.h>
28

29
#include <net/inet_connection_sock.h>
30
#include <net/inet_sock.h>
31
#include <net/sock.h>
32
#include <net/route.h>
33
#include <net/tcp_states.h>
34
#include <net/netns/hash.h>
35

A
Arun Sharma 已提交
36
#include <linux/atomic.h>
37
#include <asm/byteorder.h>
38

39
/* This is for all connections with a full identity, no wildcards.
40 41
 * One chain is dedicated to TIME_WAIT sockets.
 * I'll experiment with dynamic table growth later.
42 43
 */
struct inet_ehash_bucket {
44 45
	struct hlist_nulls_head chain;
	struct hlist_nulls_head twchain;
46
};
47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79

/* There are a few simple rules, which allow for local port reuse by
 * an application.  In essence:
 *
 *	1) Sockets bound to different interfaces may share a local port.
 *	   Failing that, goto test 2.
 *	2) If all sockets have sk->sk_reuse set, and none of them are in
 *	   TCP_LISTEN state, the port may be shared.
 *	   Failing that, goto test 3.
 *	3) If all sockets are bound to a specific inet_sk(sk)->rcv_saddr local
 *	   address, and none of them are the same, the port may be
 *	   shared.
 *	   Failing this, the port cannot be shared.
 *
 * The interesting point, is test #2.  This is what an FTP server does
 * all day.  To optimize this case we use a specific flag bit defined
 * below.  As we add sockets to a bind bucket list, we perform a
 * check of: (newsk->sk_reuse && (newsk->sk_state != TCP_LISTEN))
 * As long as all sockets added to a bind bucket pass this test,
 * the flag bit will be set.
 * The resulting situation is that tcp_v[46]_verify_bind() can just check
 * for this flag bit, if it is set and the socket trying to bind has
 * sk->sk_reuse set, we don't even have to walk the owners list at all,
 * we return that it is ok to bind this socket to the requested local port.
 *
 * Sounds like a lot of work, but it is worth it.  In a more naive
 * implementation (ie. current FreeBSD etc.) the entire list of ports
 * must be walked for each data port opened by an ftp server.  Needless
 * to say, this does not scale at all.  With a couple thousand FTP
 * users logged onto your box, isn't it nice to know that new data
 * ports are created in O(1) time?  I thought so. ;-)	-DaveM
 */
struct inet_bind_bucket {
80
#ifdef CONFIG_NET_NS
81
	struct net		*ib_net;
82
#endif
83
	unsigned short		port;
84 85 86
	signed char		fastreuse;
	signed char		fastreuseport;
	kuid_t			fastuid;
87
	int			num_owners;
88 89 90 91
	struct hlist_node	node;
	struct hlist_head	owners;
};

92 93 94 95 96
static inline struct net *ib_net(struct inet_bind_bucket *ib)
{
	return read_pnet(&ib->ib_net);
}

97 98
#define inet_bind_bucket_for_each(tb, head) \
	hlist_for_each_entry(tb, head, node)
99 100 101 102 103 104

struct inet_bind_hashbucket {
	spinlock_t		lock;
	struct hlist_head	chain;
};

105 106 107 108 109 110 111
/*
 * Sockets can be hashed in established or listening table
 * We must use different 'nulls' end-of-chain value for listening
 * hash table, or we might find a socket that was closed and
 * reallocated/inserted into established hash table
 */
#define LISTENING_NULLS_BASE (1U << 29)
112 113
struct inet_listen_hashbucket {
	spinlock_t		lock;
114
	struct hlist_nulls_head	head;
115 116
};

117 118 119 120 121 122 123 124 125
/* This is for listening sockets, thus all sockets which possess wildcards. */
#define INET_LHTABLE_SIZE	32	/* Yes, really, this is all you need. */

struct inet_hashinfo {
	/* This is for sockets with full identity only.  Sockets here will
	 * always be without wildcards and will have the following invariant:
	 *
	 *          TCP_ESTABLISHED <= sk->sk_state < TCP_CLOSE
	 *
126
	 * TIME_WAIT sockets use a separate chain (twchain).
127 128
	 */
	struct inet_ehash_bucket	*ehash;
129
	spinlock_t			*ehash_locks;
130
	unsigned int			ehash_mask;
131
	unsigned int			ehash_locks_mask;
132 133 134 135 136 137

	/* Ok, let's try this, I give up, we do need a local binding
	 * TCP hash as well as the others for fast bind/connect.
	 */
	struct inet_bind_hashbucket	*bhash;

S
Stephen Hemminger 已提交
138
	unsigned int			bhash_size;
139
	/* 4 bytes hole on 64 bit */
140

141
	struct kmem_cache		*bind_bucket_cachep;
142 143 144 145 146

	/* All the above members are written once at bootup and
	 * never written again _or_ are predominantly read-access.
	 *
	 * Now align to a new cache line as all the following members
147 148 149 150 151
	 * might be often dirty.
	 */
	/* All sockets in TCP_LISTEN state will be in here.  This is the only
	 * table where wildcard'd TCP sockets can exist.  Hash function here
	 * is just local port number.
152
	 */
153 154 155
	struct inet_listen_hashbucket	listening_hash[INET_LHTABLE_SIZE]
					____cacheline_aligned_in_smp;

156
	atomic_t			bsockets;
157 158
};

159 160 161 162
static inline struct inet_ehash_bucket *inet_ehash_bucket(
	struct inet_hashinfo *hashinfo,
	unsigned int hash)
{
163
	return &hashinfo->ehash[hash & hashinfo->ehash_mask];
164 165
}

166
static inline spinlock_t *inet_ehash_lockp(
167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188
	struct inet_hashinfo *hashinfo,
	unsigned int hash)
{
	return &hashinfo->ehash_locks[hash & hashinfo->ehash_locks_mask];
}

static inline int inet_ehash_locks_alloc(struct inet_hashinfo *hashinfo)
{
	unsigned int i, size = 256;
#if defined(CONFIG_PROVE_LOCKING)
	unsigned int nr_pcpus = 2;
#else
	unsigned int nr_pcpus = num_possible_cpus();
#endif
	if (nr_pcpus >= 4)
		size = 512;
	if (nr_pcpus >= 8)
		size = 1024;
	if (nr_pcpus >= 16)
		size = 2048;
	if (nr_pcpus >= 32)
		size = 4096;
189
	if (sizeof(spinlock_t) != 0) {
190
#ifdef CONFIG_NUMA
191 192
		if (size * sizeof(spinlock_t) > PAGE_SIZE)
			hashinfo->ehash_locks = vmalloc(size * sizeof(spinlock_t));
193 194
		else
#endif
195
		hashinfo->ehash_locks =	kmalloc(size * sizeof(spinlock_t),
196 197 198 199
						GFP_KERNEL);
		if (!hashinfo->ehash_locks)
			return ENOMEM;
		for (i = 0; i < size; i++)
200
			spin_lock_init(&hashinfo->ehash_locks[i]);
201 202 203 204 205 206 207 208 209 210
	}
	hashinfo->ehash_locks_mask = size - 1;
	return 0;
}

static inline void inet_ehash_locks_free(struct inet_hashinfo *hashinfo)
{
	if (hashinfo->ehash_locks) {
#ifdef CONFIG_NUMA
		unsigned int size = (hashinfo->ehash_locks_mask + 1) *
211
							sizeof(spinlock_t);
212 213 214 215
		if (size > PAGE_SIZE)
			vfree(hashinfo->ehash_locks);
		else
#endif
216
		kfree(hashinfo->ehash_locks);
217 218 219 220
		hashinfo->ehash_locks = NULL;
	}
}

221 222 223 224 225 226 227 228 229
struct inet_bind_bucket *
inet_bind_bucket_create(struct kmem_cache *cachep, struct net *net,
			struct inet_bind_hashbucket *head,
			const unsigned short snum);
void inet_bind_bucket_destroy(struct kmem_cache *cachep,
			      struct inet_bind_bucket *tb);

static inline int inet_bhashfn(struct net *net, const __u16 lport,
			       const int bhash_size)
230
{
231
	return (lport + net_hash_mix(net)) & (bhash_size - 1);
232 233
}

234 235
void inet_bind_hash(struct sock *sk, struct inet_bind_bucket *tb,
		    const unsigned short snum);
236

237
/* These can have wildcards, don't try too hard. */
238
static inline int inet_lhashfn(struct net *net, const unsigned short num)
239
{
240
	return (num + net_hash_mix(net)) & (INET_LHTABLE_SIZE - 1);
241 242 243 244
}

static inline int inet_sk_listen_hashfn(const struct sock *sk)
{
E
Eric Dumazet 已提交
245
	return inet_lhashfn(sock_net(sk), inet_sk(sk)->inet_num);
246 247
}

248
/* Caller must disable local BH processing. */
249
int __inet_inherit_port(struct sock *sk, struct sock *child);
250

251
void inet_put_port(struct sock *sk);
252

253
void inet_hashinfo_init(struct inet_hashinfo *h);
254

255 256 257
int __inet_hash_nolisten(struct sock *sk, struct inet_timewait_sock *tw);
void inet_hash(struct sock *sk);
void inet_unhash(struct sock *sk);
258

259 260 261 262 263 264
struct sock *__inet_lookup_listener(struct net *net,
				    struct inet_hashinfo *hashinfo,
				    const __be32 saddr, const __be16 sport,
				    const __be32 daddr,
				    const unsigned short hnum,
				    const int dif);
265

266 267
static inline struct sock *inet_lookup_listener(struct net *net,
		struct inet_hashinfo *hashinfo,
268
		__be32 saddr, __be16 sport,
269
		__be32 daddr, __be16 dport, int dif)
270
{
271 272
	return __inet_lookup_listener(net, hashinfo, saddr, sport,
				      daddr, ntohs(dport), dif);
273
}
274 275

/* Socket demux engine toys. */
A
Al Viro 已提交
276 277 278 279 280 281 282 283
/* What happens here is ugly; there's a pair of adjacent fields in
   struct inet_sock; __be16 dport followed by __u16 num.  We want to
   search by pair, so we combine the keys into a single 32bit value
   and compare with 32bit value read from &...->dport.  Let's at least
   make sure that it's not mixed with anything else...
   On 64bit targets we combine comparisons with pair of adjacent __be32
   fields in the same way.
*/
284 285
#ifdef __BIG_ENDIAN
#define INET_COMBINED_PORTS(__sport, __dport) \
A
Al Viro 已提交
286
	((__force __portpair)(((__force __u32)(__be16)(__sport) << 16) | (__u32)(__dport)))
287 288
#else /* __LITTLE_ENDIAN */
#define INET_COMBINED_PORTS(__sport, __dport) \
A
Al Viro 已提交
289
	((__force __portpair)(((__u32)(__dport) << 16) | (__force __u32)(__be16)(__sport)))
290 291 292 293 294
#endif

#if (BITS_PER_LONG == 64)
#ifdef __BIG_ENDIAN
#define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
A
Al Viro 已提交
295 296 297
	const __addrpair __name = (__force __addrpair) ( \
				   (((__force __u64)(__be32)(__saddr)) << 32) | \
				   ((__force __u64)(__be32)(__daddr)));
298 299
#else /* __LITTLE_ENDIAN */
#define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
A
Al Viro 已提交
300 301 302
	const __addrpair __name = (__force __addrpair) ( \
				   (((__force __u64)(__be32)(__daddr)) << 32) | \
				   ((__force __u64)(__be32)(__saddr)));
303
#endif /* __BIG_ENDIAN */
304
#define INET_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif)	\
E
Eric Dumazet 已提交
305 306
	(((__sk)->sk_portpair == (__ports))			&&	\
	 ((__sk)->sk_addrpair == (__cookie))			&&	\
307 308 309
	 (!(__sk)->sk_bound_dev_if	||				\
	   ((__sk)->sk_bound_dev_if == (__dif))) 		&& 	\
	 net_eq(sock_net(__sk), (__net)))
310 311
#else /* 32-bit arch */
#define INET_ADDR_COOKIE(__name, __saddr, __daddr)
312
#define INET_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif) \
E
Eric Dumazet 已提交
313 314 315
	(((__sk)->sk_portpair == (__ports))		&&		\
	 ((__sk)->sk_daddr	== (__saddr))		&&		\
	 ((__sk)->sk_rcv_saddr	== (__daddr))		&&		\
316 317 318
	 (!(__sk)->sk_bound_dev_if	||				\
	   ((__sk)->sk_bound_dev_if == (__dif))) 	&&		\
	 net_eq(sock_net(__sk), (__net)))
319
#endif /* 64-bit arch */
320

E
Eric Dumazet 已提交
321 322 323
#define INET_TW_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif)\
	INET_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif)

324 325 326 327 328 329
/*
 * Sockets in TCP_CLOSE state are _always_ taken out of the hash, so we need
 * not check it for lookups anymore, thanks Alexey. -DaveM
 *
 * Local BH must be disabled here.
 */
330 331 332 333 334
struct sock *__inet_lookup_established(struct net *net,
				       struct inet_hashinfo *hashinfo,
				       const __be32 saddr, const __be16 sport,
				       const __be32 daddr, const u16 hnum,
				       const int dif);
335

336
static inline struct sock *
337
	inet_lookup_established(struct net *net, struct inet_hashinfo *hashinfo,
338 339
				const __be32 saddr, const __be16 sport,
				const __be32 daddr, const __be16 dport,
340 341
				const int dif)
{
342
	return __inet_lookup_established(net, hashinfo, saddr, sport, daddr,
343 344 345
					 ntohs(dport), dif);
}

346 347
static inline struct sock *__inet_lookup(struct net *net,
					 struct inet_hashinfo *hashinfo,
348 349
					 const __be32 saddr, const __be16 sport,
					 const __be32 daddr, const __be16 dport,
350 351
					 const int dif)
{
352
	u16 hnum = ntohs(dport);
353 354 355
	struct sock *sk = __inet_lookup_established(net, hashinfo,
				saddr, sport, daddr, hnum, dif);

356 357
	return sk ? : __inet_lookup_listener(net, hashinfo, saddr, sport,
					     daddr, hnum, dif);
358 359
}

360 361
static inline struct sock *inet_lookup(struct net *net,
				       struct inet_hashinfo *hashinfo,
362 363
				       const __be32 saddr, const __be16 sport,
				       const __be32 daddr, const __be16 dport,
364 365 366 367 368
				       const int dif)
{
	struct sock *sk;

	local_bh_disable();
369
	sk = __inet_lookup(net, hashinfo, saddr, sport, daddr, dport, dif);
370 371 372 373
	local_bh_enable();

	return sk;
}
374

375 376 377 378 379
static inline struct sock *__inet_lookup_skb(struct inet_hashinfo *hashinfo,
					     struct sk_buff *skb,
					     const __be16 sport,
					     const __be16 dport)
{
D
David S. Miller 已提交
380
	struct sock *sk = skb_steal_sock(skb);
381 382
	const struct iphdr *iph = ip_hdr(skb);

D
David S. Miller 已提交
383
	if (sk)
384 385
		return sk;
	else
E
Eric Dumazet 已提交
386
		return __inet_lookup(dev_net(skb_dst(skb)->dev), hashinfo,
387 388
				     iph->saddr, sport,
				     iph->daddr, dport, inet_iif(skb));
389 390
}

391 392 393 394 395 396 397
int __inet_hash_connect(struct inet_timewait_death_row *death_row,
			struct sock *sk, u32 port_offset,
			int (*check_established)(struct inet_timewait_death_row *,
						 struct sock *, __u16,
						 struct inet_timewait_sock **),
			int (*hash)(struct sock *sk,
				    struct inet_timewait_sock *twp));
398

399 400
int inet_hash_connect(struct inet_timewait_death_row *death_row,
		      struct sock *sk);
401
#endif /* _INET_HASHTABLES_H */