inet_hashtables.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437
  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/config.h>
  16. #include <linux/interrupt.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 <net/inet_connection_sock.h>
  25. #include <net/route.h>
  26. #include <net/sock.h>
  27. #include <net/tcp_states.h>
  28. #include <asm/atomic.h>
  29. #include <asm/byteorder.h>
  30. /* This is for all connections with a full identity, no wildcards.
  31. * New scheme, half the table is for TIME_WAIT, the other half is
  32. * for the rest. I'll experiment with dynamic table growth later.
  33. */
  34. struct inet_ehash_bucket {
  35. rwlock_t lock;
  36. struct hlist_head chain;
  37. };
  38. /* There are a few simple rules, which allow for local port reuse by
  39. * an application. In essence:
  40. *
  41. * 1) Sockets bound to different interfaces may share a local port.
  42. * Failing that, goto test 2.
  43. * 2) If all sockets have sk->sk_reuse set, and none of them are in
  44. * TCP_LISTEN state, the port may be shared.
  45. * Failing that, goto test 3.
  46. * 3) If all sockets are bound to a specific inet_sk(sk)->rcv_saddr local
  47. * address, and none of them are the same, the port may be
  48. * shared.
  49. * Failing this, the port cannot be shared.
  50. *
  51. * The interesting point, is test #2. This is what an FTP server does
  52. * all day. To optimize this case we use a specific flag bit defined
  53. * below. As we add sockets to a bind bucket list, we perform a
  54. * check of: (newsk->sk_reuse && (newsk->sk_state != TCP_LISTEN))
  55. * As long as all sockets added to a bind bucket pass this test,
  56. * the flag bit will be set.
  57. * The resulting situation is that tcp_v[46]_verify_bind() can just check
  58. * for this flag bit, if it is set and the socket trying to bind has
  59. * sk->sk_reuse set, we don't even have to walk the owners list at all,
  60. * we return that it is ok to bind this socket to the requested local port.
  61. *
  62. * Sounds like a lot of work, but it is worth it. In a more naive
  63. * implementation (ie. current FreeBSD etc.) the entire list of ports
  64. * must be walked for each data port opened by an ftp server. Needless
  65. * to say, this does not scale at all. With a couple thousand FTP
  66. * users logged onto your box, isn't it nice to know that new data
  67. * ports are created in O(1) time? I thought so. ;-) -DaveM
  68. */
  69. struct inet_bind_bucket {
  70. unsigned short port;
  71. signed short fastreuse;
  72. struct hlist_node node;
  73. struct hlist_head owners;
  74. };
  75. #define inet_bind_bucket_for_each(tb, node, head) \
  76. hlist_for_each_entry(tb, node, head, node)
  77. struct inet_bind_hashbucket {
  78. spinlock_t lock;
  79. struct hlist_head chain;
  80. };
  81. /* This is for listening sockets, thus all sockets which possess wildcards. */
  82. #define INET_LHTABLE_SIZE 32 /* Yes, really, this is all you need. */
  83. struct inet_hashinfo {
  84. /* This is for sockets with full identity only. Sockets here will
  85. * always be without wildcards and will have the following invariant:
  86. *
  87. * TCP_ESTABLISHED <= sk->sk_state < TCP_CLOSE
  88. *
  89. * First half of the table is for sockets not in TIME_WAIT, second half
  90. * is for TIME_WAIT sockets only.
  91. */
  92. struct inet_ehash_bucket *ehash;
  93. /* Ok, let's try this, I give up, we do need a local binding
  94. * TCP hash as well as the others for fast bind/connect.
  95. */
  96. struct inet_bind_hashbucket *bhash;
  97. int bhash_size;
  98. unsigned int ehash_size;
  99. /* All sockets in TCP_LISTEN state will be in here. This is the only
  100. * table where wildcard'd TCP sockets can exist. Hash function here
  101. * is just local port number.
  102. */
  103. struct hlist_head listening_hash[INET_LHTABLE_SIZE];
  104. /* All the above members are written once at bootup and
  105. * never written again _or_ are predominantly read-access.
  106. *
  107. * Now align to a new cache line as all the following members
  108. * are often dirty.
  109. */
  110. rwlock_t lhash_lock ____cacheline_aligned;
  111. atomic_t lhash_users;
  112. wait_queue_head_t lhash_wait;
  113. kmem_cache_t *bind_bucket_cachep;
  114. };
  115. static inline unsigned int inet_ehashfn(const __u32 laddr, const __u16 lport,
  116. const __u32 faddr, const __u16 fport)
  117. {
  118. unsigned int h = (laddr ^ lport) ^ (faddr ^ fport);
  119. h ^= h >> 16;
  120. h ^= h >> 8;
  121. return h;
  122. }
  123. static inline int inet_sk_ehashfn(const struct sock *sk)
  124. {
  125. const struct inet_sock *inet = inet_sk(sk);
  126. const __u32 laddr = inet->rcv_saddr;
  127. const __u16 lport = inet->num;
  128. const __u32 faddr = inet->daddr;
  129. const __u16 fport = inet->dport;
  130. return inet_ehashfn(laddr, lport, faddr, fport);
  131. }
  132. static inline struct inet_ehash_bucket *inet_ehash_bucket(
  133. struct inet_hashinfo *hashinfo,
  134. unsigned int hash)
  135. {
  136. return &hashinfo->ehash[hash & (hashinfo->ehash_size - 1)];
  137. }
  138. extern struct inet_bind_bucket *
  139. inet_bind_bucket_create(kmem_cache_t *cachep,
  140. struct inet_bind_hashbucket *head,
  141. const unsigned short snum);
  142. extern void inet_bind_bucket_destroy(kmem_cache_t *cachep,
  143. struct inet_bind_bucket *tb);
  144. static inline int inet_bhashfn(const __u16 lport, const int bhash_size)
  145. {
  146. return lport & (bhash_size - 1);
  147. }
  148. extern void inet_bind_hash(struct sock *sk, struct inet_bind_bucket *tb,
  149. const unsigned short snum);
  150. /* These can have wildcards, don't try too hard. */
  151. static inline int inet_lhashfn(const unsigned short num)
  152. {
  153. return num & (INET_LHTABLE_SIZE - 1);
  154. }
  155. static inline int inet_sk_listen_hashfn(const struct sock *sk)
  156. {
  157. return inet_lhashfn(inet_sk(sk)->num);
  158. }
  159. /* Caller must disable local BH processing. */
  160. static inline void __inet_inherit_port(struct inet_hashinfo *table,
  161. struct sock *sk, struct sock *child)
  162. {
  163. const int bhash = inet_bhashfn(inet_sk(child)->num, table->bhash_size);
  164. struct inet_bind_hashbucket *head = &table->bhash[bhash];
  165. struct inet_bind_bucket *tb;
  166. spin_lock(&head->lock);
  167. tb = inet_csk(sk)->icsk_bind_hash;
  168. sk_add_bind_node(child, &tb->owners);
  169. inet_csk(child)->icsk_bind_hash = tb;
  170. spin_unlock(&head->lock);
  171. }
  172. static inline void inet_inherit_port(struct inet_hashinfo *table,
  173. struct sock *sk, struct sock *child)
  174. {
  175. local_bh_disable();
  176. __inet_inherit_port(table, sk, child);
  177. local_bh_enable();
  178. }
  179. extern void inet_put_port(struct inet_hashinfo *table, struct sock *sk);
  180. extern void inet_listen_wlock(struct inet_hashinfo *hashinfo);
  181. /*
  182. * - We may sleep inside this lock.
  183. * - If sleeping is not required (or called from BH),
  184. * use plain read_(un)lock(&inet_hashinfo.lhash_lock).
  185. */
  186. static inline void inet_listen_lock(struct inet_hashinfo *hashinfo)
  187. {
  188. /* read_lock synchronizes to candidates to writers */
  189. read_lock(&hashinfo->lhash_lock);
  190. atomic_inc(&hashinfo->lhash_users);
  191. read_unlock(&hashinfo->lhash_lock);
  192. }
  193. static inline void inet_listen_unlock(struct inet_hashinfo *hashinfo)
  194. {
  195. if (atomic_dec_and_test(&hashinfo->lhash_users))
  196. wake_up(&hashinfo->lhash_wait);
  197. }
  198. static inline void __inet_hash(struct inet_hashinfo *hashinfo,
  199. struct sock *sk, const int listen_possible)
  200. {
  201. struct hlist_head *list;
  202. rwlock_t *lock;
  203. BUG_TRAP(sk_unhashed(sk));
  204. if (listen_possible && sk->sk_state == TCP_LISTEN) {
  205. list = &hashinfo->listening_hash[inet_sk_listen_hashfn(sk)];
  206. lock = &hashinfo->lhash_lock;
  207. inet_listen_wlock(hashinfo);
  208. } else {
  209. struct inet_ehash_bucket *head;
  210. sk->sk_hash = inet_sk_ehashfn(sk);
  211. head = inet_ehash_bucket(hashinfo, sk->sk_hash);
  212. list = &head->chain;
  213. lock = &head->lock;
  214. write_lock(lock);
  215. }
  216. __sk_add_node(sk, list);
  217. sock_prot_inc_use(sk->sk_prot);
  218. write_unlock(lock);
  219. if (listen_possible && sk->sk_state == TCP_LISTEN)
  220. wake_up(&hashinfo->lhash_wait);
  221. }
  222. static inline void inet_hash(struct inet_hashinfo *hashinfo, struct sock *sk)
  223. {
  224. if (sk->sk_state != TCP_CLOSE) {
  225. local_bh_disable();
  226. __inet_hash(hashinfo, sk, 1);
  227. local_bh_enable();
  228. }
  229. }
  230. static inline void inet_unhash(struct inet_hashinfo *hashinfo, struct sock *sk)
  231. {
  232. rwlock_t *lock;
  233. if (sk_unhashed(sk))
  234. goto out;
  235. if (sk->sk_state == TCP_LISTEN) {
  236. local_bh_disable();
  237. inet_listen_wlock(hashinfo);
  238. lock = &hashinfo->lhash_lock;
  239. } else {
  240. lock = &inet_ehash_bucket(hashinfo, sk->sk_hash)->lock;
  241. write_lock_bh(lock);
  242. }
  243. if (__sk_del_node_init(sk))
  244. sock_prot_dec_use(sk->sk_prot);
  245. write_unlock_bh(lock);
  246. out:
  247. if (sk->sk_state == TCP_LISTEN)
  248. wake_up(&hashinfo->lhash_wait);
  249. }
  250. static inline int inet_iif(const struct sk_buff *skb)
  251. {
  252. return ((struct rtable *)skb->dst)->rt_iif;
  253. }
  254. extern struct sock *__inet_lookup_listener(const struct hlist_head *head,
  255. const u32 daddr,
  256. const unsigned short hnum,
  257. const int dif);
  258. /* Optimize the common listener case. */
  259. static inline struct sock *
  260. inet_lookup_listener(struct inet_hashinfo *hashinfo,
  261. const u32 daddr,
  262. const unsigned short hnum, const int dif)
  263. {
  264. struct sock *sk = NULL;
  265. const struct hlist_head *head;
  266. read_lock(&hashinfo->lhash_lock);
  267. head = &hashinfo->listening_hash[inet_lhashfn(hnum)];
  268. if (!hlist_empty(head)) {
  269. const struct inet_sock *inet = inet_sk((sk = __sk_head(head)));
  270. if (inet->num == hnum && !sk->sk_node.next &&
  271. (!inet->rcv_saddr || inet->rcv_saddr == daddr) &&
  272. (sk->sk_family == PF_INET || !ipv6_only_sock(sk)) &&
  273. !sk->sk_bound_dev_if)
  274. goto sherry_cache;
  275. sk = __inet_lookup_listener(head, daddr, hnum, dif);
  276. }
  277. if (sk) {
  278. sherry_cache:
  279. sock_hold(sk);
  280. }
  281. read_unlock(&hashinfo->lhash_lock);
  282. return sk;
  283. }
  284. /* Socket demux engine toys. */
  285. #ifdef __BIG_ENDIAN
  286. #define INET_COMBINED_PORTS(__sport, __dport) \
  287. (((__u32)(__sport) << 16) | (__u32)(__dport))
  288. #else /* __LITTLE_ENDIAN */
  289. #define INET_COMBINED_PORTS(__sport, __dport) \
  290. (((__u32)(__dport) << 16) | (__u32)(__sport))
  291. #endif
  292. #if (BITS_PER_LONG == 64)
  293. #ifdef __BIG_ENDIAN
  294. #define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
  295. const __u64 __name = (((__u64)(__saddr)) << 32) | ((__u64)(__daddr));
  296. #else /* __LITTLE_ENDIAN */
  297. #define INET_ADDR_COOKIE(__name, __saddr, __daddr) \
  298. const __u64 __name = (((__u64)(__daddr)) << 32) | ((__u64)(__saddr));
  299. #endif /* __BIG_ENDIAN */
  300. #define INET_MATCH(__sk, __hash, __cookie, __saddr, __daddr, __ports, __dif)\
  301. (((__sk)->sk_hash == (__hash)) && \
  302. ((*((__u64 *)&(inet_sk(__sk)->daddr))) == (__cookie)) && \
  303. ((*((__u32 *)&(inet_sk(__sk)->dport))) == (__ports)) && \
  304. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  305. #define INET_TW_MATCH(__sk, __hash, __cookie, __saddr, __daddr, __ports, __dif)\
  306. (((__sk)->sk_hash == (__hash)) && \
  307. ((*((__u64 *)&(inet_twsk(__sk)->tw_daddr))) == (__cookie)) && \
  308. ((*((__u32 *)&(inet_twsk(__sk)->tw_dport))) == (__ports)) && \
  309. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  310. #else /* 32-bit arch */
  311. #define INET_ADDR_COOKIE(__name, __saddr, __daddr)
  312. #define INET_MATCH(__sk, __hash, __cookie, __saddr, __daddr, __ports, __dif) \
  313. (((__sk)->sk_hash == (__hash)) && \
  314. (inet_sk(__sk)->daddr == (__saddr)) && \
  315. (inet_sk(__sk)->rcv_saddr == (__daddr)) && \
  316. ((*((__u32 *)&(inet_sk(__sk)->dport))) == (__ports)) && \
  317. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  318. #define INET_TW_MATCH(__sk, __hash,__cookie, __saddr, __daddr, __ports, __dif) \
  319. (((__sk)->sk_hash == (__hash)) && \
  320. (inet_twsk(__sk)->tw_daddr == (__saddr)) && \
  321. (inet_twsk(__sk)->tw_rcv_saddr == (__daddr)) && \
  322. ((*((__u32 *)&(inet_twsk(__sk)->tw_dport))) == (__ports)) && \
  323. (!((__sk)->sk_bound_dev_if) || ((__sk)->sk_bound_dev_if == (__dif))))
  324. #endif /* 64-bit arch */
  325. /*
  326. * Sockets in TCP_CLOSE state are _always_ taken out of the hash, so we need
  327. * not check it for lookups anymore, thanks Alexey. -DaveM
  328. *
  329. * Local BH must be disabled here.
  330. */
  331. static inline struct sock *
  332. __inet_lookup_established(struct inet_hashinfo *hashinfo,
  333. const u32 saddr, const u16 sport,
  334. const u32 daddr, const u16 hnum,
  335. const int dif)
  336. {
  337. INET_ADDR_COOKIE(acookie, saddr, daddr)
  338. const __u32 ports = INET_COMBINED_PORTS(sport, hnum);
  339. struct sock *sk;
  340. const struct hlist_node *node;
  341. /* Optimize here for direct hit, only listening connections can
  342. * have wildcards anyways.
  343. */
  344. unsigned int hash = inet_ehashfn(daddr, hnum, saddr, sport);
  345. struct inet_ehash_bucket *head = inet_ehash_bucket(hashinfo, hash);
  346. prefetch(head->chain.first);
  347. read_lock(&head->lock);
  348. sk_for_each(sk, node, &head->chain) {
  349. if (INET_MATCH(sk, hash, acookie, saddr, daddr, ports, dif))
  350. goto hit; /* You sunk my battleship! */
  351. }
  352. /* Must check for a TIME_WAIT'er before going to listener hash. */
  353. sk_for_each(sk, node, &(head + hashinfo->ehash_size)->chain) {
  354. if (INET_TW_MATCH(sk, hash, acookie, saddr, daddr, ports, dif))
  355. goto hit;
  356. }
  357. sk = NULL;
  358. out:
  359. read_unlock(&head->lock);
  360. return sk;
  361. hit:
  362. sock_hold(sk);
  363. goto out;
  364. }
  365. static inline struct sock *__inet_lookup(struct inet_hashinfo *hashinfo,
  366. const u32 saddr, const u16 sport,
  367. const u32 daddr, const u16 hnum,
  368. const int dif)
  369. {
  370. struct sock *sk = __inet_lookup_established(hashinfo, saddr, sport, daddr,
  371. hnum, dif);
  372. return sk ? : inet_lookup_listener(hashinfo, daddr, hnum, dif);
  373. }
  374. static inline struct sock *inet_lookup(struct inet_hashinfo *hashinfo,
  375. const u32 saddr, const u16 sport,
  376. const u32 daddr, const u16 dport,
  377. const int dif)
  378. {
  379. struct sock *sk;
  380. local_bh_disable();
  381. sk = __inet_lookup(hashinfo, saddr, sport, daddr, ntohs(dport), dif);
  382. local_bh_enable();
  383. return sk;
  384. }
  385. #endif /* _INET_HASHTABLES_H */