inet_hashtables.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411
  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 <linux/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 char fastreuse;
  78. signed char fastreuseport;
  79. kuid_t fastuid;
  80. int num_owners;
  81. struct hlist_node node;
  82. struct hlist_head owners;
  83. };
  84. static inline struct net *ib_net(struct inet_bind_bucket *ib)
  85. {
  86. return read_pnet(&ib->ib_net);
  87. }
  88. #define inet_bind_bucket_for_each(tb, head) \
  89. hlist_for_each_entry(tb, head, node)
  90. struct inet_bind_hashbucket {
  91. spinlock_t lock;
  92. struct hlist_head chain;
  93. };
  94. /*
  95. * Sockets can be hashed in established or listening table
  96. * We must use different 'nulls' end-of-chain value for listening
  97. * hash table, or we might find a socket that was closed and
  98. * reallocated/inserted into established hash table
  99. */
  100. #define LISTENING_NULLS_BASE (1U << 29)
  101. struct inet_listen_hashbucket {
  102. spinlock_t lock;
  103. struct hlist_nulls_head head;
  104. };
  105. /* This is for listening sockets, thus all sockets which possess wildcards. */
  106. #define INET_LHTABLE_SIZE 32 /* Yes, really, this is all you need. */
  107. struct inet_hashinfo {
  108. /* This is for sockets with full identity only. Sockets here will
  109. * always be without wildcards and will have the following invariant:
  110. *
  111. * TCP_ESTABLISHED <= sk->sk_state < TCP_CLOSE
  112. *
  113. * TIME_WAIT sockets use a separate chain (twchain).
  114. */
  115. struct inet_ehash_bucket *ehash;
  116. spinlock_t *ehash_locks;
  117. unsigned int ehash_mask;
  118. unsigned int ehash_locks_mask;
  119. /* Ok, let's try this, I give up, we do need a local binding
  120. * TCP hash as well as the others for fast bind/connect.
  121. */
  122. struct inet_bind_hashbucket *bhash;
  123. unsigned int bhash_size;
  124. /* 4 bytes hole on 64 bit */
  125. struct kmem_cache *bind_bucket_cachep;
  126. /* All the above members are written once at bootup and
  127. * never written again _or_ are predominantly read-access.
  128. *
  129. * Now align to a new cache line as all the following members
  130. * might be often dirty.
  131. */
  132. /* All sockets in TCP_LISTEN state will be in here. This is the only
  133. * table where wildcard'd TCP sockets can exist. Hash function here
  134. * is just local port number.
  135. */
  136. struct inet_listen_hashbucket listening_hash[INET_LHTABLE_SIZE]
  137. ____cacheline_aligned_in_smp;
  138. atomic_t bsockets;
  139. };
  140. static inline struct inet_ehash_bucket *inet_ehash_bucket(
  141. struct inet_hashinfo *hashinfo,
  142. unsigned int hash)
  143. {
  144. return &hashinfo->ehash[hash & hashinfo->ehash_mask];
  145. }
  146. static inline spinlock_t *inet_ehash_lockp(
  147. struct inet_hashinfo *hashinfo,
  148. unsigned int hash)
  149. {
  150. return &hashinfo->ehash_locks[hash & hashinfo->ehash_locks_mask];
  151. }
  152. static inline int inet_ehash_locks_alloc(struct inet_hashinfo *hashinfo)
  153. {
  154. unsigned int i, size = 256;
  155. #if defined(CONFIG_PROVE_LOCKING)
  156. unsigned int nr_pcpus = 2;
  157. #else
  158. unsigned int nr_pcpus = num_possible_cpus();
  159. #endif
  160. if (nr_pcpus >= 4)
  161. size = 512;
  162. if (nr_pcpus >= 8)
  163. size = 1024;
  164. if (nr_pcpus >= 16)
  165. size = 2048;
  166. if (nr_pcpus >= 32)
  167. size = 4096;
  168. if (sizeof(spinlock_t) != 0) {
  169. #ifdef CONFIG_NUMA
  170. if (size * sizeof(spinlock_t) > PAGE_SIZE)
  171. hashinfo->ehash_locks = vmalloc(size * sizeof(spinlock_t));
  172. else
  173. #endif
  174. hashinfo->ehash_locks = kmalloc(size * sizeof(spinlock_t),
  175. GFP_KERNEL);
  176. if (!hashinfo->ehash_locks)
  177. return ENOMEM;
  178. for (i = 0; i < size; i++)
  179. spin_lock_init(&hashinfo->ehash_locks[i]);
  180. }
  181. hashinfo->ehash_locks_mask = size - 1;
  182. return 0;
  183. }
  184. static inline void inet_ehash_locks_free(struct inet_hashinfo *hashinfo)
  185. {
  186. if (hashinfo->ehash_locks) {
  187. #ifdef CONFIG_NUMA
  188. unsigned int size = (hashinfo->ehash_locks_mask + 1) *
  189. sizeof(spinlock_t);
  190. if (size > PAGE_SIZE)
  191. vfree(hashinfo->ehash_locks);
  192. else
  193. #endif
  194. kfree(hashinfo->ehash_locks);
  195. hashinfo->ehash_locks = NULL;
  196. }
  197. }
  198. extern struct inet_bind_bucket *
  199. inet_bind_bucket_create(struct kmem_cache *cachep,
  200. struct net *net,
  201. struct inet_bind_hashbucket *head,
  202. const unsigned short snum);
  203. extern void inet_bind_bucket_destroy(struct kmem_cache *cachep,
  204. struct inet_bind_bucket *tb);
  205. static inline int inet_bhashfn(struct net *net,
  206. const __u16 lport, const int bhash_size)
  207. {
  208. return (lport + net_hash_mix(net)) & (bhash_size - 1);
  209. }
  210. extern void inet_bind_hash(struct sock *sk, struct inet_bind_bucket *tb,
  211. const unsigned short snum);
  212. /* These can have wildcards, don't try too hard. */
  213. static inline int inet_lhashfn(struct net *net, const unsigned short num)
  214. {
  215. return (num + net_hash_mix(net)) & (INET_LHTABLE_SIZE - 1);
  216. }
  217. static inline int inet_sk_listen_hashfn(const struct sock *sk)
  218. {
  219. return inet_lhashfn(sock_net(sk), inet_sk(sk)->inet_num);
  220. }
  221. /* Caller must disable local BH processing. */
  222. extern int __inet_inherit_port(struct sock *sk, struct sock *child);
  223. extern void inet_put_port(struct sock *sk);
  224. void inet_hashinfo_init(struct inet_hashinfo *h);
  225. extern int __inet_hash_nolisten(struct sock *sk, struct inet_timewait_sock *tw);
  226. extern void inet_hash(struct sock *sk);
  227. extern void inet_unhash(struct sock *sk);
  228. extern struct sock *__inet_lookup_listener(struct net *net,
  229. struct inet_hashinfo *hashinfo,
  230. const __be32 saddr,
  231. const __be16 sport,
  232. const __be32 daddr,
  233. const unsigned short hnum,
  234. const int dif);
  235. static inline struct sock *inet_lookup_listener(struct net *net,
  236. struct inet_hashinfo *hashinfo,
  237. __be32 saddr, __be16 sport,
  238. __be32 daddr, __be16 dport, int dif)
  239. {
  240. return __inet_lookup_listener(net, hashinfo, saddr, sport,
  241. daddr, ntohs(dport), dif);
  242. }
  243. /* Socket demux engine toys. */
  244. /* What happens here is ugly; there's a pair of adjacent fields in
  245. struct inet_sock; __be16 dport followed by __u16 num. We want to
  246. search by pair, so we combine the keys into a single 32bit value
  247. and compare with 32bit value read from &...->dport. Let's at least
  248. make sure that it's not mixed with anything else...
  249. On 64bit targets we combine comparisons with pair of adjacent __be32
  250. fields in the same way.
  251. */
  252. #ifdef __BIG_ENDIAN
  253. #define INET_COMBINED_PORTS(__sport, __dport) \
  254. ((__force __portpair)(((__force __u32)(__be16)(__sport) << 16) | (__u32)(__dport)))
  255. #else /* __LITTLE_ENDIAN */
  256. #define INET_COMBINED_PORTS(__sport, __dport) \
  257. ((__force __portpair)(((__u32)(__dport) << 16) | (__force __u32)(__be16)(__sport)))
  258. #endif
  259. #if (BITS_PER_LONG == 64)
  260. #ifdef __BIG_ENDIAN
  261. #define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
  262. const __addrpair __name = (__force __addrpair) ( \
  263. (((__force __u64)(__be32)(__saddr)) << 32) | \
  264. ((__force __u64)(__be32)(__daddr)));
  265. #else /* __LITTLE_ENDIAN */
  266. #define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
  267. const __addrpair __name = (__force __addrpair) ( \
  268. (((__force __u64)(__be32)(__daddr)) << 32) | \
  269. ((__force __u64)(__be32)(__saddr)));
  270. #endif /* __BIG_ENDIAN */
  271. #define INET_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif) \
  272. ((inet_sk(__sk)->inet_portpair == (__ports)) && \
  273. (inet_sk(__sk)->inet_addrpair == (__cookie)) && \
  274. (!(__sk)->sk_bound_dev_if || \
  275. ((__sk)->sk_bound_dev_if == (__dif))) && \
  276. net_eq(sock_net(__sk), (__net)))
  277. #define INET_TW_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif)\
  278. ((inet_twsk(__sk)->tw_portpair == (__ports)) && \
  279. (inet_twsk(__sk)->tw_addrpair == (__cookie)) && \
  280. (!(__sk)->sk_bound_dev_if || \
  281. ((__sk)->sk_bound_dev_if == (__dif))) && \
  282. net_eq(sock_net(__sk), (__net)))
  283. #else /* 32-bit arch */
  284. #define INET_ADDR_COOKIE(__name, __saddr, __daddr)
  285. #define INET_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif) \
  286. ((inet_sk(__sk)->inet_portpair == (__ports)) && \
  287. (inet_sk(__sk)->inet_daddr == (__saddr)) && \
  288. (inet_sk(__sk)->inet_rcv_saddr == (__daddr)) && \
  289. (!(__sk)->sk_bound_dev_if || \
  290. ((__sk)->sk_bound_dev_if == (__dif))) && \
  291. net_eq(sock_net(__sk), (__net)))
  292. #define INET_TW_MATCH(__sk, __net, __cookie, __saddr, __daddr, __ports, __dif) \
  293. ((inet_twsk(__sk)->tw_portpair == (__ports)) && \
  294. (inet_twsk(__sk)->tw_daddr == (__saddr)) && \
  295. (inet_twsk(__sk)->tw_rcv_saddr == (__daddr)) && \
  296. (!(__sk)->sk_bound_dev_if || \
  297. ((__sk)->sk_bound_dev_if == (__dif))) && \
  298. net_eq(sock_net(__sk), (__net)))
  299. #endif /* 64-bit arch */
  300. /*
  301. * Sockets in TCP_CLOSE state are _always_ taken out of the hash, so we need
  302. * not check it for lookups anymore, thanks Alexey. -DaveM
  303. *
  304. * Local BH must be disabled here.
  305. */
  306. extern struct sock * __inet_lookup_established(struct net *net,
  307. struct inet_hashinfo *hashinfo,
  308. const __be32 saddr, const __be16 sport,
  309. const __be32 daddr, const u16 hnum, const int dif);
  310. static inline struct sock *
  311. inet_lookup_established(struct net *net, struct inet_hashinfo *hashinfo,
  312. const __be32 saddr, const __be16 sport,
  313. const __be32 daddr, const __be16 dport,
  314. const int dif)
  315. {
  316. return __inet_lookup_established(net, hashinfo, saddr, sport, daddr,
  317. ntohs(dport), dif);
  318. }
  319. static inline struct sock *__inet_lookup(struct net *net,
  320. struct inet_hashinfo *hashinfo,
  321. const __be32 saddr, const __be16 sport,
  322. const __be32 daddr, const __be16 dport,
  323. const int dif)
  324. {
  325. u16 hnum = ntohs(dport);
  326. struct sock *sk = __inet_lookup_established(net, hashinfo,
  327. saddr, sport, daddr, hnum, dif);
  328. return sk ? : __inet_lookup_listener(net, hashinfo, saddr, sport,
  329. daddr, hnum, dif);
  330. }
  331. static inline struct sock *inet_lookup(struct net *net,
  332. struct inet_hashinfo *hashinfo,
  333. const __be32 saddr, const __be16 sport,
  334. const __be32 daddr, const __be16 dport,
  335. const int dif)
  336. {
  337. struct sock *sk;
  338. local_bh_disable();
  339. sk = __inet_lookup(net, hashinfo, saddr, sport, daddr, dport, dif);
  340. local_bh_enable();
  341. return sk;
  342. }
  343. static inline struct sock *__inet_lookup_skb(struct inet_hashinfo *hashinfo,
  344. struct sk_buff *skb,
  345. const __be16 sport,
  346. const __be16 dport)
  347. {
  348. struct sock *sk = skb_steal_sock(skb);
  349. const struct iphdr *iph = ip_hdr(skb);
  350. if (sk)
  351. return sk;
  352. else
  353. return __inet_lookup(dev_net(skb_dst(skb)->dev), hashinfo,
  354. iph->saddr, sport,
  355. iph->daddr, dport, inet_iif(skb));
  356. }
  357. extern int __inet_hash_connect(struct inet_timewait_death_row *death_row,
  358. struct sock *sk,
  359. u32 port_offset,
  360. int (*check_established)(struct inet_timewait_death_row *,
  361. struct sock *, __u16, struct inet_timewait_sock **),
  362. int (*hash)(struct sock *sk, struct inet_timewait_sock *twp));
  363. extern int inet_hash_connect(struct inet_timewait_death_row *death_row,
  364. struct sock *sk);
  365. #endif /* _INET_HASHTABLES_H */