inet_hashtables.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391
  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. * Authors: Lotsa people, from code originally in tcp
  7. *
  8. * This program is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU General Public License
  10. * as published by the Free Software Foundation; either version
  11. * 2 of the License, or (at your option) any later version.
  12. */
  13. #ifndef _INET_HASHTABLES_H
  14. #define _INET_HASHTABLES_H
  15. #include <linux/interrupt.h>
  16. #include <linux/ip.h>
  17. #include <linux/ipv6.h>
  18. #include <linux/list.h>
  19. #include <linux/slab.h>
  20. #include <linux/socket.h>
  21. #include <linux/spinlock.h>
  22. #include <linux/types.h>
  23. #include <linux/wait.h>
  24. #include <linux/vmalloc.h>
  25. #include <net/inet_connection_sock.h>
  26. #include <net/inet_sock.h>
  27. #include <net/sock.h>
  28. #include <net/route.h>
  29. #include <net/tcp_states.h>
  30. #include <net/netns/hash.h>
  31. #include <asm/atomic.h>
  32. #include <asm/byteorder.h>
  33. /* This is for all connections with a full identity, no wildcards.
  34. * One chain is dedicated to TIME_WAIT sockets.
  35. * I'll experiment with dynamic table growth later.
  36. */
  37. struct inet_ehash_bucket {
  38. struct hlist_nulls_head chain;
  39. struct hlist_nulls_head twchain;
  40. };
  41. /* There are a few simple rules, which allow for local port reuse by
  42. * an application. In essence:
  43. *
  44. * 1) Sockets bound to different interfaces may share a local port.
  45. * Failing that, goto test 2.
  46. * 2) If all sockets have sk->sk_reuse set, and none of them are in
  47. * TCP_LISTEN state, the port may be shared.
  48. * Failing that, goto test 3.
  49. * 3) If all sockets are bound to a specific inet_sk(sk)->rcv_saddr local
  50. * address, and none of them are the same, the port may be
  51. * shared.
  52. * Failing this, the port cannot be shared.
  53. *
  54. * The interesting point, is test #2. This is what an FTP server does
  55. * all day. To optimize this case we use a specific flag bit defined
  56. * below. As we add sockets to a bind bucket list, we perform a
  57. * check of: (newsk->sk_reuse && (newsk->sk_state != TCP_LISTEN))
  58. * As long as all sockets added to a bind bucket pass this test,
  59. * the flag bit will be set.
  60. * The resulting situation is that tcp_v[46]_verify_bind() can just check
  61. * for this flag bit, if it is set and the socket trying to bind has
  62. * sk->sk_reuse set, we don't even have to walk the owners list at all,
  63. * we return that it is ok to bind this socket to the requested local port.
  64. *
  65. * Sounds like a lot of work, but it is worth it. In a more naive
  66. * implementation (ie. current FreeBSD etc.) the entire list of ports
  67. * must be walked for each data port opened by an ftp server. Needless
  68. * to say, this does not scale at all. With a couple thousand FTP
  69. * users logged onto your box, isn't it nice to know that new data
  70. * ports are created in O(1) time? I thought so. ;-) -DaveM
  71. */
  72. struct inet_bind_bucket {
  73. #ifdef CONFIG_NET_NS
  74. struct net *ib_net;
  75. #endif
  76. unsigned short port;
  77. signed short fastreuse;
  78. struct hlist_node node;
  79. struct hlist_head owners;
  80. };
  81. static inline struct net *ib_net(struct inet_bind_bucket *ib)
  82. {
  83. return read_pnet(&ib->ib_net);
  84. }
  85. #define inet_bind_bucket_for_each(tb, node, head) \
  86. hlist_for_each_entry(tb, node, head, node)
  87. struct inet_bind_hashbucket {
  88. spinlock_t lock;
  89. struct hlist_head chain;
  90. };
  91. struct inet_listen_hashbucket {
  92. spinlock_t lock;
  93. struct hlist_head head;
  94. };
  95. /* This is for listening sockets, thus all sockets which possess wildcards. */
  96. #define INET_LHTABLE_SIZE 32 /* Yes, really, this is all you need. */
  97. struct inet_hashinfo {
  98. /* This is for sockets with full identity only. Sockets here will
  99. * always be without wildcards and will have the following invariant:
  100. *
  101. * TCP_ESTABLISHED <= sk->sk_state < TCP_CLOSE
  102. *
  103. * TIME_WAIT sockets use a separate chain (twchain).
  104. */
  105. struct inet_ehash_bucket *ehash;
  106. spinlock_t *ehash_locks;
  107. unsigned int ehash_size;
  108. unsigned int ehash_locks_mask;
  109. /* Ok, let's try this, I give up, we do need a local binding
  110. * TCP hash as well as the others for fast bind/connect.
  111. */
  112. struct inet_bind_hashbucket *bhash;
  113. unsigned int bhash_size;
  114. /* Note : 4 bytes padding on 64 bit arches */
  115. struct kmem_cache *bind_bucket_cachep;
  116. /* All the above members are written once at bootup and
  117. * never written again _or_ are predominantly read-access.
  118. *
  119. * Now align to a new cache line as all the following members
  120. * might be often dirty.
  121. */
  122. /* All sockets in TCP_LISTEN state will be in here. This is the only
  123. * table where wildcard'd TCP sockets can exist. Hash function here
  124. * is just local port number.
  125. */
  126. struct inet_listen_hashbucket listening_hash[INET_LHTABLE_SIZE]
  127. ____cacheline_aligned_in_smp;
  128. };
  129. static inline struct inet_ehash_bucket *inet_ehash_bucket(
  130. struct inet_hashinfo *hashinfo,
  131. unsigned int hash)
  132. {
  133. return &hashinfo->ehash[hash & (hashinfo->ehash_size - 1)];
  134. }
  135. static inline spinlock_t *inet_ehash_lockp(
  136. struct inet_hashinfo *hashinfo,
  137. unsigned int hash)
  138. {
  139. return &hashinfo->ehash_locks[hash & hashinfo->ehash_locks_mask];
  140. }
  141. static inline int inet_ehash_locks_alloc(struct inet_hashinfo *hashinfo)
  142. {
  143. unsigned int i, size = 256;
  144. #if defined(CONFIG_PROVE_LOCKING)
  145. unsigned int nr_pcpus = 2;
  146. #else
  147. unsigned int nr_pcpus = num_possible_cpus();
  148. #endif
  149. if (nr_pcpus >= 4)
  150. size = 512;
  151. if (nr_pcpus >= 8)
  152. size = 1024;
  153. if (nr_pcpus >= 16)
  154. size = 2048;
  155. if (nr_pcpus >= 32)
  156. size = 4096;
  157. if (sizeof(rwlock_t) != 0) {
  158. #ifdef CONFIG_NUMA
  159. if (size * sizeof(spinlock_t) > PAGE_SIZE)
  160. hashinfo->ehash_locks = vmalloc(size * sizeof(spinlock_t));
  161. else
  162. #endif
  163. hashinfo->ehash_locks = kmalloc(size * sizeof(spinlock_t),
  164. GFP_KERNEL);
  165. if (!hashinfo->ehash_locks)
  166. return ENOMEM;
  167. for (i = 0; i < size; i++)
  168. spin_lock_init(&hashinfo->ehash_locks[i]);
  169. }
  170. hashinfo->ehash_locks_mask = size - 1;
  171. return 0;
  172. }
  173. static inline void inet_ehash_locks_free(struct inet_hashinfo *hashinfo)
  174. {
  175. if (hashinfo->ehash_locks) {
  176. #ifdef CONFIG_NUMA
  177. unsigned int size = (hashinfo->ehash_locks_mask + 1) *
  178. sizeof(spinlock_t);
  179. if (size > PAGE_SIZE)
  180. vfree(hashinfo->ehash_locks);
  181. else
  182. #endif
  183. kfree(hashinfo->ehash_locks);
  184. hashinfo->ehash_locks = NULL;
  185. }
  186. }
  187. extern struct inet_bind_bucket *
  188. inet_bind_bucket_create(struct kmem_cache *cachep,
  189. struct net *net,
  190. struct inet_bind_hashbucket *head,
  191. const unsigned short snum);
  192. extern void inet_bind_bucket_destroy(struct kmem_cache *cachep,
  193. struct inet_bind_bucket *tb);
  194. static inline int inet_bhashfn(struct net *net,
  195. const __u16 lport, const int bhash_size)
  196. {
  197. return (lport + net_hash_mix(net)) & (bhash_size - 1);
  198. }
  199. extern void inet_bind_hash(struct sock *sk, struct inet_bind_bucket *tb,
  200. const unsigned short snum);
  201. /* These can have wildcards, don't try too hard. */
  202. static inline int inet_lhashfn(struct net *net, const unsigned short num)
  203. {
  204. return (num + net_hash_mix(net)) & (INET_LHTABLE_SIZE - 1);
  205. }
  206. static inline int inet_sk_listen_hashfn(const struct sock *sk)
  207. {
  208. return inet_lhashfn(sock_net(sk), inet_sk(sk)->num);
  209. }
  210. /* Caller must disable local BH processing. */
  211. extern void __inet_inherit_port(struct sock *sk, struct sock *child);
  212. extern void inet_put_port(struct sock *sk);
  213. void inet_hashinfo_init(struct inet_hashinfo *h);
  214. extern void __inet_hash_nolisten(struct sock *sk);
  215. extern void inet_hash(struct sock *sk);
  216. extern void inet_unhash(struct sock *sk);
  217. extern struct sock *__inet_lookup_listener(struct net *net,
  218. struct inet_hashinfo *hashinfo,
  219. const __be32 daddr,
  220. const unsigned short hnum,
  221. const int dif);
  222. static inline struct sock *inet_lookup_listener(struct net *net,
  223. struct inet_hashinfo *hashinfo,
  224. __be32 daddr, __be16 dport, int dif)
  225. {
  226. return __inet_lookup_listener(net, hashinfo, daddr, ntohs(dport), dif);
  227. }
  228. /* Socket demux engine toys. */
  229. /* What happens here is ugly; there's a pair of adjacent fields in
  230. struct inet_sock; __be16 dport followed by __u16 num. We want to
  231. search by pair, so we combine the keys into a single 32bit value
  232. and compare with 32bit value read from &...->dport. Let's at least
  233. make sure that it's not mixed with anything else...
  234. On 64bit targets we combine comparisons with pair of adjacent __be32
  235. fields in the same way.
  236. */
  237. typedef __u32 __bitwise __portpair;
  238. #ifdef __BIG_ENDIAN
  239. #define INET_COMBINED_PORTS(__sport, __dport) \
  240. ((__force __portpair)(((__force __u32)(__be16)(__sport) << 16) | (__u32)(__dport)))
  241. #else /* __LITTLE_ENDIAN */
  242. #define INET_COMBINED_PORTS(__sport, __dport) \
  243. ((__force __portpair)(((__u32)(__dport) << 16) | (__force __u32)(__be16)(__sport)))
  244. #endif
  245. #if (BITS_PER_LONG == 64)
  246. typedef __u64 __bitwise __addrpair;
  247. #ifdef __BIG_ENDIAN
  248. #define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
  249. const __addrpair __name = (__force __addrpair) ( \
  250. (((__force __u64)(__be32)(__saddr)) << 32) | \
  251. ((__force __u64)(__be32)(__daddr)));
  252. #else /* __LITTLE_ENDIAN */
  253. #define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
  254. const __addrpair __name = (__force __addrpair) ( \
  255. (((__force __u64)(__be32)(__daddr)) << 32) | \
  256. ((__force __u64)(__be32)(__saddr)));
  257. #endif /* __BIG_ENDIAN */
  258. #define INET_MATCH(__sk, __net, __hash, __cookie, __saddr, __daddr, __ports, __dif)\
  259. (((__sk)->sk_hash == (__hash)) && net_eq(sock_net(__sk), (__net)) && \
  260. ((*((__addrpair *)&(inet_sk(__sk)->daddr))) == (__cookie)) && \
  261. ((*((__portpair *)&(inet_sk(__sk)->dport))) == (__ports)) && \
  262. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  263. #define INET_TW_MATCH(__sk, __net, __hash, __cookie, __saddr, __daddr, __ports, __dif)\
  264. (((__sk)->sk_hash == (__hash)) && net_eq(sock_net(__sk), (__net)) && \
  265. ((*((__addrpair *)&(inet_twsk(__sk)->tw_daddr))) == (__cookie)) && \
  266. ((*((__portpair *)&(inet_twsk(__sk)->tw_dport))) == (__ports)) && \
  267. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  268. #else /* 32-bit arch */
  269. #define INET_ADDR_COOKIE(__name, __saddr, __daddr)
  270. #define INET_MATCH(__sk, __net, __hash, __cookie, __saddr, __daddr, __ports, __dif) \
  271. (((__sk)->sk_hash == (__hash)) && net_eq(sock_net(__sk), (__net)) && \
  272. (inet_sk(__sk)->daddr == (__saddr)) && \
  273. (inet_sk(__sk)->rcv_saddr == (__daddr)) && \
  274. ((*((__portpair *)&(inet_sk(__sk)->dport))) == (__ports)) && \
  275. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  276. #define INET_TW_MATCH(__sk, __net, __hash,__cookie, __saddr, __daddr, __ports, __dif) \
  277. (((__sk)->sk_hash == (__hash)) && net_eq(sock_net(__sk), (__net)) && \
  278. (inet_twsk(__sk)->tw_daddr == (__saddr)) && \
  279. (inet_twsk(__sk)->tw_rcv_saddr == (__daddr)) && \
  280. ((*((__portpair *)&(inet_twsk(__sk)->tw_dport))) == (__ports)) && \
  281. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  282. #endif /* 64-bit arch */
  283. /*
  284. * Sockets in TCP_CLOSE state are _always_ taken out of the hash, so we need
  285. * not check it for lookups anymore, thanks Alexey. -DaveM
  286. *
  287. * Local BH must be disabled here.
  288. */
  289. extern struct sock * __inet_lookup_established(struct net *net,
  290. struct inet_hashinfo *hashinfo,
  291. const __be32 saddr, const __be16 sport,
  292. const __be32 daddr, const u16 hnum, const int dif);
  293. static inline struct sock *
  294. inet_lookup_established(struct net *net, struct inet_hashinfo *hashinfo,
  295. const __be32 saddr, const __be16 sport,
  296. const __be32 daddr, const __be16 dport,
  297. const int dif)
  298. {
  299. return __inet_lookup_established(net, hashinfo, saddr, sport, daddr,
  300. ntohs(dport), dif);
  301. }
  302. static inline struct sock *__inet_lookup(struct net *net,
  303. struct inet_hashinfo *hashinfo,
  304. const __be32 saddr, const __be16 sport,
  305. const __be32 daddr, const __be16 dport,
  306. const int dif)
  307. {
  308. u16 hnum = ntohs(dport);
  309. struct sock *sk = __inet_lookup_established(net, hashinfo,
  310. saddr, sport, daddr, hnum, dif);
  311. return sk ? : __inet_lookup_listener(net, hashinfo, daddr, hnum, dif);
  312. }
  313. static inline struct sock *inet_lookup(struct net *net,
  314. struct inet_hashinfo *hashinfo,
  315. const __be32 saddr, const __be16 sport,
  316. const __be32 daddr, const __be16 dport,
  317. const int dif)
  318. {
  319. struct sock *sk;
  320. local_bh_disable();
  321. sk = __inet_lookup(net, hashinfo, saddr, sport, daddr, dport, dif);
  322. local_bh_enable();
  323. return sk;
  324. }
  325. static inline struct sock *__inet_lookup_skb(struct inet_hashinfo *hashinfo,
  326. struct sk_buff *skb,
  327. const __be16 sport,
  328. const __be16 dport)
  329. {
  330. struct sock *sk;
  331. const struct iphdr *iph = ip_hdr(skb);
  332. if (unlikely(sk = skb_steal_sock(skb)))
  333. return sk;
  334. else
  335. return __inet_lookup(dev_net(skb->dst->dev), hashinfo,
  336. iph->saddr, sport,
  337. iph->daddr, dport, inet_iif(skb));
  338. }
  339. extern int __inet_hash_connect(struct inet_timewait_death_row *death_row,
  340. struct sock *sk, u32 port_offset,
  341. int (*check_established)(struct inet_timewait_death_row *,
  342. struct sock *, __u16, struct inet_timewait_sock **),
  343. void (*hash)(struct sock *sk));
  344. extern int inet_hash_connect(struct inet_timewait_death_row *death_row,
  345. struct sock *sk);
  346. #endif /* _INET_HASHTABLES_H */