inet_hashtables.h 13 KB

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