inet_hashtables.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698
  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. * Generic INET transport hashtables
  7. *
  8. * Authors: Lotsa people, from code originally in tcp
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public License
  12. * as published by the Free Software Foundation; either version
  13. * 2 of the License, or (at your option) any later version.
  14. */
  15. #include <linux/module.h>
  16. #include <linux/random.h>
  17. #include <linux/sched.h>
  18. #include <linux/slab.h>
  19. #include <linux/wait.h>
  20. #include <linux/vmalloc.h>
  21. #include <net/addrconf.h>
  22. #include <net/inet_connection_sock.h>
  23. #include <net/inet_hashtables.h>
  24. #include <net/secure_seq.h>
  25. #include <net/ip.h>
  26. #include <net/tcp.h>
  27. #include <net/sock_reuseport.h>
  28. static u32 inet_ehashfn(const struct net *net, const __be32 laddr,
  29. const __u16 lport, const __be32 faddr,
  30. const __be16 fport)
  31. {
  32. static u32 inet_ehash_secret __read_mostly;
  33. net_get_random_once(&inet_ehash_secret, sizeof(inet_ehash_secret));
  34. return __inet_ehashfn(laddr, lport, faddr, fport,
  35. inet_ehash_secret + net_hash_mix(net));
  36. }
  37. /* This function handles inet_sock, but also timewait and request sockets
  38. * for IPv4/IPv6.
  39. */
  40. static u32 sk_ehashfn(const struct sock *sk)
  41. {
  42. #if IS_ENABLED(CONFIG_IPV6)
  43. if (sk->sk_family == AF_INET6 &&
  44. !ipv6_addr_v4mapped(&sk->sk_v6_daddr))
  45. return inet6_ehashfn(sock_net(sk),
  46. &sk->sk_v6_rcv_saddr, sk->sk_num,
  47. &sk->sk_v6_daddr, sk->sk_dport);
  48. #endif
  49. return inet_ehashfn(sock_net(sk),
  50. sk->sk_rcv_saddr, sk->sk_num,
  51. sk->sk_daddr, sk->sk_dport);
  52. }
  53. /*
  54. * Allocate and initialize a new local port bind bucket.
  55. * The bindhash mutex for snum's hash chain must be held here.
  56. */
  57. struct inet_bind_bucket *inet_bind_bucket_create(struct kmem_cache *cachep,
  58. struct net *net,
  59. struct inet_bind_hashbucket *head,
  60. const unsigned short snum)
  61. {
  62. struct inet_bind_bucket *tb = kmem_cache_alloc(cachep, GFP_ATOMIC);
  63. if (tb) {
  64. write_pnet(&tb->ib_net, net);
  65. tb->port = snum;
  66. tb->fastreuse = 0;
  67. tb->fastreuseport = 0;
  68. INIT_HLIST_HEAD(&tb->owners);
  69. hlist_add_head(&tb->node, &head->chain);
  70. }
  71. return tb;
  72. }
  73. /*
  74. * Caller must hold hashbucket lock for this tb with local BH disabled
  75. */
  76. void inet_bind_bucket_destroy(struct kmem_cache *cachep, struct inet_bind_bucket *tb)
  77. {
  78. if (hlist_empty(&tb->owners)) {
  79. __hlist_del(&tb->node);
  80. kmem_cache_free(cachep, tb);
  81. }
  82. }
  83. void inet_bind_hash(struct sock *sk, struct inet_bind_bucket *tb,
  84. const unsigned short snum)
  85. {
  86. inet_sk(sk)->inet_num = snum;
  87. sk_add_bind_node(sk, &tb->owners);
  88. inet_csk(sk)->icsk_bind_hash = tb;
  89. }
  90. /*
  91. * Get rid of any references to a local port held by the given sock.
  92. */
  93. static void __inet_put_port(struct sock *sk)
  94. {
  95. struct inet_hashinfo *hashinfo = sk->sk_prot->h.hashinfo;
  96. const int bhash = inet_bhashfn(sock_net(sk), inet_sk(sk)->inet_num,
  97. hashinfo->bhash_size);
  98. struct inet_bind_hashbucket *head = &hashinfo->bhash[bhash];
  99. struct inet_bind_bucket *tb;
  100. spin_lock(&head->lock);
  101. tb = inet_csk(sk)->icsk_bind_hash;
  102. __sk_del_bind_node(sk);
  103. inet_csk(sk)->icsk_bind_hash = NULL;
  104. inet_sk(sk)->inet_num = 0;
  105. inet_bind_bucket_destroy(hashinfo->bind_bucket_cachep, tb);
  106. spin_unlock(&head->lock);
  107. }
  108. void inet_put_port(struct sock *sk)
  109. {
  110. local_bh_disable();
  111. __inet_put_port(sk);
  112. local_bh_enable();
  113. }
  114. EXPORT_SYMBOL(inet_put_port);
  115. int __inet_inherit_port(const struct sock *sk, struct sock *child)
  116. {
  117. struct inet_hashinfo *table = sk->sk_prot->h.hashinfo;
  118. unsigned short port = inet_sk(child)->inet_num;
  119. const int bhash = inet_bhashfn(sock_net(sk), port,
  120. table->bhash_size);
  121. struct inet_bind_hashbucket *head = &table->bhash[bhash];
  122. struct inet_bind_bucket *tb;
  123. spin_lock(&head->lock);
  124. tb = inet_csk(sk)->icsk_bind_hash;
  125. if (unlikely(!tb)) {
  126. spin_unlock(&head->lock);
  127. return -ENOENT;
  128. }
  129. if (tb->port != port) {
  130. /* NOTE: using tproxy and redirecting skbs to a proxy
  131. * on a different listener port breaks the assumption
  132. * that the listener socket's icsk_bind_hash is the same
  133. * as that of the child socket. We have to look up or
  134. * create a new bind bucket for the child here. */
  135. inet_bind_bucket_for_each(tb, &head->chain) {
  136. if (net_eq(ib_net(tb), sock_net(sk)) &&
  137. tb->port == port)
  138. break;
  139. }
  140. if (!tb) {
  141. tb = inet_bind_bucket_create(table->bind_bucket_cachep,
  142. sock_net(sk), head, port);
  143. if (!tb) {
  144. spin_unlock(&head->lock);
  145. return -ENOMEM;
  146. }
  147. }
  148. }
  149. inet_bind_hash(child, tb, port);
  150. spin_unlock(&head->lock);
  151. return 0;
  152. }
  153. EXPORT_SYMBOL_GPL(__inet_inherit_port);
  154. static inline int compute_score(struct sock *sk, struct net *net,
  155. const unsigned short hnum, const __be32 daddr,
  156. const int dif, const int sdif, bool exact_dif)
  157. {
  158. int score = -1;
  159. struct inet_sock *inet = inet_sk(sk);
  160. if (net_eq(sock_net(sk), net) && inet->inet_num == hnum &&
  161. !ipv6_only_sock(sk)) {
  162. __be32 rcv_saddr = inet->inet_rcv_saddr;
  163. score = sk->sk_family == PF_INET ? 2 : 1;
  164. if (rcv_saddr) {
  165. if (rcv_saddr != daddr)
  166. return -1;
  167. score += 4;
  168. }
  169. if (sk->sk_bound_dev_if || exact_dif) {
  170. bool dev_match = (sk->sk_bound_dev_if == dif ||
  171. sk->sk_bound_dev_if == sdif);
  172. if (exact_dif && !dev_match)
  173. return -1;
  174. if (sk->sk_bound_dev_if && dev_match)
  175. score += 4;
  176. }
  177. if (sk->sk_incoming_cpu == raw_smp_processor_id())
  178. score++;
  179. }
  180. return score;
  181. }
  182. /*
  183. * Here are some nice properties to exploit here. The BSD API
  184. * does not allow a listening sock to specify the remote port nor the
  185. * remote address for the connection. So always assume those are both
  186. * wildcarded during the search since they can never be otherwise.
  187. */
  188. /* called with rcu_read_lock() : No refcount taken on the socket */
  189. struct sock *__inet_lookup_listener(struct net *net,
  190. struct inet_hashinfo *hashinfo,
  191. struct sk_buff *skb, int doff,
  192. const __be32 saddr, __be16 sport,
  193. const __be32 daddr, const unsigned short hnum,
  194. const int dif, const int sdif)
  195. {
  196. unsigned int hash = inet_lhashfn(net, hnum);
  197. struct inet_listen_hashbucket *ilb = &hashinfo->listening_hash[hash];
  198. int score, hiscore = 0, matches = 0, reuseport = 0;
  199. bool exact_dif = inet_exact_dif_match(net, skb);
  200. struct sock *sk, *result = NULL;
  201. u32 phash = 0;
  202. sk_for_each_rcu(sk, &ilb->head) {
  203. score = compute_score(sk, net, hnum, daddr,
  204. dif, sdif, exact_dif);
  205. if (score > hiscore) {
  206. reuseport = sk->sk_reuseport;
  207. if (reuseport) {
  208. phash = inet_ehashfn(net, daddr, hnum,
  209. saddr, sport);
  210. result = reuseport_select_sock(sk, phash,
  211. skb, doff);
  212. if (result)
  213. return result;
  214. matches = 1;
  215. }
  216. result = sk;
  217. hiscore = score;
  218. } else if (score == hiscore && reuseport) {
  219. matches++;
  220. if (reciprocal_scale(phash, matches) == 0)
  221. result = sk;
  222. phash = next_pseudo_random32(phash);
  223. }
  224. }
  225. return result;
  226. }
  227. EXPORT_SYMBOL_GPL(__inet_lookup_listener);
  228. /* All sockets share common refcount, but have different destructors */
  229. void sock_gen_put(struct sock *sk)
  230. {
  231. if (!refcount_dec_and_test(&sk->sk_refcnt))
  232. return;
  233. if (sk->sk_state == TCP_TIME_WAIT)
  234. inet_twsk_free(inet_twsk(sk));
  235. else if (sk->sk_state == TCP_NEW_SYN_RECV)
  236. reqsk_free(inet_reqsk(sk));
  237. else
  238. sk_free(sk);
  239. }
  240. EXPORT_SYMBOL_GPL(sock_gen_put);
  241. void sock_edemux(struct sk_buff *skb)
  242. {
  243. sock_gen_put(skb->sk);
  244. }
  245. EXPORT_SYMBOL(sock_edemux);
  246. struct sock *__inet_lookup_established(struct net *net,
  247. struct inet_hashinfo *hashinfo,
  248. const __be32 saddr, const __be16 sport,
  249. const __be32 daddr, const u16 hnum,
  250. const int dif, const int sdif)
  251. {
  252. INET_ADDR_COOKIE(acookie, saddr, daddr);
  253. const __portpair ports = INET_COMBINED_PORTS(sport, hnum);
  254. struct sock *sk;
  255. const struct hlist_nulls_node *node;
  256. /* Optimize here for direct hit, only listening connections can
  257. * have wildcards anyways.
  258. */
  259. unsigned int hash = inet_ehashfn(net, daddr, hnum, saddr, sport);
  260. unsigned int slot = hash & hashinfo->ehash_mask;
  261. struct inet_ehash_bucket *head = &hashinfo->ehash[slot];
  262. begin:
  263. sk_nulls_for_each_rcu(sk, node, &head->chain) {
  264. if (sk->sk_hash != hash)
  265. continue;
  266. if (likely(INET_MATCH(sk, net, acookie,
  267. saddr, daddr, ports, dif, sdif))) {
  268. if (unlikely(!refcount_inc_not_zero(&sk->sk_refcnt)))
  269. goto out;
  270. if (unlikely(!INET_MATCH(sk, net, acookie,
  271. saddr, daddr, ports,
  272. dif, sdif))) {
  273. sock_gen_put(sk);
  274. goto begin;
  275. }
  276. goto found;
  277. }
  278. }
  279. /*
  280. * if the nulls value we got at the end of this lookup is
  281. * not the expected one, we must restart lookup.
  282. * We probably met an item that was moved to another chain.
  283. */
  284. if (get_nulls_value(node) != slot)
  285. goto begin;
  286. out:
  287. sk = NULL;
  288. found:
  289. return sk;
  290. }
  291. EXPORT_SYMBOL_GPL(__inet_lookup_established);
  292. /* called with local bh disabled */
  293. static int __inet_check_established(struct inet_timewait_death_row *death_row,
  294. struct sock *sk, __u16 lport,
  295. struct inet_timewait_sock **twp)
  296. {
  297. struct inet_hashinfo *hinfo = death_row->hashinfo;
  298. struct inet_sock *inet = inet_sk(sk);
  299. __be32 daddr = inet->inet_rcv_saddr;
  300. __be32 saddr = inet->inet_daddr;
  301. int dif = sk->sk_bound_dev_if;
  302. struct net *net = sock_net(sk);
  303. int sdif = l3mdev_master_ifindex_by_index(net, dif);
  304. INET_ADDR_COOKIE(acookie, saddr, daddr);
  305. const __portpair ports = INET_COMBINED_PORTS(inet->inet_dport, lport);
  306. unsigned int hash = inet_ehashfn(net, daddr, lport,
  307. saddr, inet->inet_dport);
  308. struct inet_ehash_bucket *head = inet_ehash_bucket(hinfo, hash);
  309. spinlock_t *lock = inet_ehash_lockp(hinfo, hash);
  310. struct sock *sk2;
  311. const struct hlist_nulls_node *node;
  312. struct inet_timewait_sock *tw = NULL;
  313. spin_lock(lock);
  314. sk_nulls_for_each(sk2, node, &head->chain) {
  315. if (sk2->sk_hash != hash)
  316. continue;
  317. if (likely(INET_MATCH(sk2, net, acookie,
  318. saddr, daddr, ports, dif, sdif))) {
  319. if (sk2->sk_state == TCP_TIME_WAIT) {
  320. tw = inet_twsk(sk2);
  321. if (twsk_unique(sk, sk2, twp))
  322. break;
  323. }
  324. goto not_unique;
  325. }
  326. }
  327. /* Must record num and sport now. Otherwise we will see
  328. * in hash table socket with a funny identity.
  329. */
  330. inet->inet_num = lport;
  331. inet->inet_sport = htons(lport);
  332. sk->sk_hash = hash;
  333. WARN_ON(!sk_unhashed(sk));
  334. __sk_nulls_add_node_rcu(sk, &head->chain);
  335. if (tw) {
  336. sk_nulls_del_node_init_rcu((struct sock *)tw);
  337. __NET_INC_STATS(net, LINUX_MIB_TIMEWAITRECYCLED);
  338. }
  339. spin_unlock(lock);
  340. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
  341. if (twp) {
  342. *twp = tw;
  343. } else if (tw) {
  344. /* Silly. Should hash-dance instead... */
  345. inet_twsk_deschedule_put(tw);
  346. }
  347. return 0;
  348. not_unique:
  349. spin_unlock(lock);
  350. return -EADDRNOTAVAIL;
  351. }
  352. static u32 inet_sk_port_offset(const struct sock *sk)
  353. {
  354. const struct inet_sock *inet = inet_sk(sk);
  355. return secure_ipv4_port_ephemeral(inet->inet_rcv_saddr,
  356. inet->inet_daddr,
  357. inet->inet_dport);
  358. }
  359. /* insert a socket into ehash, and eventually remove another one
  360. * (The another one can be a SYN_RECV or TIMEWAIT
  361. */
  362. bool inet_ehash_insert(struct sock *sk, struct sock *osk)
  363. {
  364. struct inet_hashinfo *hashinfo = sk->sk_prot->h.hashinfo;
  365. struct hlist_nulls_head *list;
  366. struct inet_ehash_bucket *head;
  367. spinlock_t *lock;
  368. bool ret = true;
  369. WARN_ON_ONCE(!sk_unhashed(sk));
  370. sk->sk_hash = sk_ehashfn(sk);
  371. head = inet_ehash_bucket(hashinfo, sk->sk_hash);
  372. list = &head->chain;
  373. lock = inet_ehash_lockp(hashinfo, sk->sk_hash);
  374. spin_lock(lock);
  375. if (osk) {
  376. WARN_ON_ONCE(sk->sk_hash != osk->sk_hash);
  377. ret = sk_nulls_del_node_init_rcu(osk);
  378. }
  379. if (ret)
  380. __sk_nulls_add_node_rcu(sk, list);
  381. spin_unlock(lock);
  382. return ret;
  383. }
  384. bool inet_ehash_nolisten(struct sock *sk, struct sock *osk)
  385. {
  386. bool ok = inet_ehash_insert(sk, osk);
  387. if (ok) {
  388. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
  389. } else {
  390. percpu_counter_inc(sk->sk_prot->orphan_count);
  391. sk->sk_state = TCP_CLOSE;
  392. sock_set_flag(sk, SOCK_DEAD);
  393. inet_csk_destroy_sock(sk);
  394. }
  395. return ok;
  396. }
  397. EXPORT_SYMBOL_GPL(inet_ehash_nolisten);
  398. static int inet_reuseport_add_sock(struct sock *sk,
  399. struct inet_listen_hashbucket *ilb)
  400. {
  401. struct inet_bind_bucket *tb = inet_csk(sk)->icsk_bind_hash;
  402. struct sock *sk2;
  403. kuid_t uid = sock_i_uid(sk);
  404. sk_for_each_rcu(sk2, &ilb->head) {
  405. if (sk2 != sk &&
  406. sk2->sk_family == sk->sk_family &&
  407. ipv6_only_sock(sk2) == ipv6_only_sock(sk) &&
  408. sk2->sk_bound_dev_if == sk->sk_bound_dev_if &&
  409. inet_csk(sk2)->icsk_bind_hash == tb &&
  410. sk2->sk_reuseport && uid_eq(uid, sock_i_uid(sk2)) &&
  411. inet_rcv_saddr_equal(sk, sk2, false))
  412. return reuseport_add_sock(sk, sk2);
  413. }
  414. /* Initial allocation may have already happened via setsockopt */
  415. if (!rcu_access_pointer(sk->sk_reuseport_cb))
  416. return reuseport_alloc(sk);
  417. return 0;
  418. }
  419. int __inet_hash(struct sock *sk, struct sock *osk)
  420. {
  421. struct inet_hashinfo *hashinfo = sk->sk_prot->h.hashinfo;
  422. struct inet_listen_hashbucket *ilb;
  423. int err = 0;
  424. if (sk->sk_state != TCP_LISTEN) {
  425. inet_ehash_nolisten(sk, osk);
  426. return 0;
  427. }
  428. WARN_ON(!sk_unhashed(sk));
  429. ilb = &hashinfo->listening_hash[inet_sk_listen_hashfn(sk)];
  430. spin_lock(&ilb->lock);
  431. if (sk->sk_reuseport) {
  432. err = inet_reuseport_add_sock(sk, ilb);
  433. if (err)
  434. goto unlock;
  435. }
  436. if (IS_ENABLED(CONFIG_IPV6) && sk->sk_reuseport &&
  437. sk->sk_family == AF_INET6)
  438. hlist_add_tail_rcu(&sk->sk_node, &ilb->head);
  439. else
  440. hlist_add_head_rcu(&sk->sk_node, &ilb->head);
  441. sock_set_flag(sk, SOCK_RCU_FREE);
  442. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, 1);
  443. unlock:
  444. spin_unlock(&ilb->lock);
  445. return err;
  446. }
  447. EXPORT_SYMBOL(__inet_hash);
  448. int inet_hash(struct sock *sk)
  449. {
  450. int err = 0;
  451. if (sk->sk_state != TCP_CLOSE) {
  452. local_bh_disable();
  453. err = __inet_hash(sk, NULL);
  454. local_bh_enable();
  455. }
  456. return err;
  457. }
  458. EXPORT_SYMBOL_GPL(inet_hash);
  459. void inet_unhash(struct sock *sk)
  460. {
  461. struct inet_hashinfo *hashinfo = sk->sk_prot->h.hashinfo;
  462. spinlock_t *lock;
  463. bool listener = false;
  464. int done;
  465. if (sk_unhashed(sk))
  466. return;
  467. if (sk->sk_state == TCP_LISTEN) {
  468. lock = &hashinfo->listening_hash[inet_sk_listen_hashfn(sk)].lock;
  469. listener = true;
  470. } else {
  471. lock = inet_ehash_lockp(hashinfo, sk->sk_hash);
  472. }
  473. spin_lock_bh(lock);
  474. if (rcu_access_pointer(sk->sk_reuseport_cb))
  475. reuseport_detach_sock(sk);
  476. if (listener)
  477. done = __sk_del_node_init(sk);
  478. else
  479. done = __sk_nulls_del_node_init_rcu(sk);
  480. if (done)
  481. sock_prot_inuse_add(sock_net(sk), sk->sk_prot, -1);
  482. spin_unlock_bh(lock);
  483. }
  484. EXPORT_SYMBOL_GPL(inet_unhash);
  485. int __inet_hash_connect(struct inet_timewait_death_row *death_row,
  486. struct sock *sk, u32 port_offset,
  487. int (*check_established)(struct inet_timewait_death_row *,
  488. struct sock *, __u16, struct inet_timewait_sock **))
  489. {
  490. struct inet_hashinfo *hinfo = death_row->hashinfo;
  491. struct inet_timewait_sock *tw = NULL;
  492. struct inet_bind_hashbucket *head;
  493. int port = inet_sk(sk)->inet_num;
  494. struct net *net = sock_net(sk);
  495. struct inet_bind_bucket *tb;
  496. u32 remaining, offset;
  497. int ret, i, low, high;
  498. static u32 hint;
  499. if (port) {
  500. head = &hinfo->bhash[inet_bhashfn(net, port,
  501. hinfo->bhash_size)];
  502. tb = inet_csk(sk)->icsk_bind_hash;
  503. spin_lock_bh(&head->lock);
  504. if (sk_head(&tb->owners) == sk && !sk->sk_bind_node.next) {
  505. inet_ehash_nolisten(sk, NULL);
  506. spin_unlock_bh(&head->lock);
  507. return 0;
  508. }
  509. spin_unlock(&head->lock);
  510. /* No definite answer... Walk to established hash table */
  511. ret = check_established(death_row, sk, port, NULL);
  512. local_bh_enable();
  513. return ret;
  514. }
  515. inet_get_local_port_range(net, &low, &high);
  516. high++; /* [32768, 60999] -> [32768, 61000[ */
  517. remaining = high - low;
  518. if (likely(remaining > 1))
  519. remaining &= ~1U;
  520. offset = (hint + port_offset) % remaining;
  521. /* In first pass we try ports of @low parity.
  522. * inet_csk_get_port() does the opposite choice.
  523. */
  524. offset &= ~1U;
  525. other_parity_scan:
  526. port = low + offset;
  527. for (i = 0; i < remaining; i += 2, port += 2) {
  528. if (unlikely(port >= high))
  529. port -= remaining;
  530. if (inet_is_local_reserved_port(net, port))
  531. continue;
  532. head = &hinfo->bhash[inet_bhashfn(net, port,
  533. hinfo->bhash_size)];
  534. spin_lock_bh(&head->lock);
  535. /* Does not bother with rcv_saddr checks, because
  536. * the established check is already unique enough.
  537. */
  538. inet_bind_bucket_for_each(tb, &head->chain) {
  539. if (net_eq(ib_net(tb), net) && tb->port == port) {
  540. if (tb->fastreuse >= 0 ||
  541. tb->fastreuseport >= 0)
  542. goto next_port;
  543. WARN_ON(hlist_empty(&tb->owners));
  544. if (!check_established(death_row, sk,
  545. port, &tw))
  546. goto ok;
  547. goto next_port;
  548. }
  549. }
  550. tb = inet_bind_bucket_create(hinfo->bind_bucket_cachep,
  551. net, head, port);
  552. if (!tb) {
  553. spin_unlock_bh(&head->lock);
  554. return -ENOMEM;
  555. }
  556. tb->fastreuse = -1;
  557. tb->fastreuseport = -1;
  558. goto ok;
  559. next_port:
  560. spin_unlock_bh(&head->lock);
  561. cond_resched();
  562. }
  563. offset++;
  564. if ((offset & 1) && remaining > 1)
  565. goto other_parity_scan;
  566. return -EADDRNOTAVAIL;
  567. ok:
  568. hint += i + 2;
  569. /* Head lock still held and bh's disabled */
  570. inet_bind_hash(sk, tb, port);
  571. if (sk_unhashed(sk)) {
  572. inet_sk(sk)->inet_sport = htons(port);
  573. inet_ehash_nolisten(sk, (struct sock *)tw);
  574. }
  575. if (tw)
  576. inet_twsk_bind_unhash(tw, hinfo);
  577. spin_unlock(&head->lock);
  578. if (tw)
  579. inet_twsk_deschedule_put(tw);
  580. local_bh_enable();
  581. return 0;
  582. }
  583. /*
  584. * Bind a port for a connect operation and hash it.
  585. */
  586. int inet_hash_connect(struct inet_timewait_death_row *death_row,
  587. struct sock *sk)
  588. {
  589. u32 port_offset = 0;
  590. if (!inet_sk(sk)->inet_num)
  591. port_offset = inet_sk_port_offset(sk);
  592. return __inet_hash_connect(death_row, sk, port_offset,
  593. __inet_check_established);
  594. }
  595. EXPORT_SYMBOL_GPL(inet_hash_connect);
  596. void inet_hashinfo_init(struct inet_hashinfo *h)
  597. {
  598. int i;
  599. for (i = 0; i < INET_LHTABLE_SIZE; i++) {
  600. spin_lock_init(&h->listening_hash[i].lock);
  601. INIT_HLIST_HEAD(&h->listening_hash[i].head);
  602. }
  603. }
  604. EXPORT_SYMBOL_GPL(inet_hashinfo_init);
  605. int inet_ehash_locks_alloc(struct inet_hashinfo *hashinfo)
  606. {
  607. unsigned int locksz = sizeof(spinlock_t);
  608. unsigned int i, nblocks = 1;
  609. if (locksz != 0) {
  610. /* allocate 2 cache lines or at least one spinlock per cpu */
  611. nblocks = max(2U * L1_CACHE_BYTES / locksz, 1U);
  612. nblocks = roundup_pow_of_two(nblocks * num_possible_cpus());
  613. /* no more locks than number of hash buckets */
  614. nblocks = min(nblocks, hashinfo->ehash_mask + 1);
  615. hashinfo->ehash_locks = kvmalloc_array(nblocks, locksz, GFP_KERNEL);
  616. if (!hashinfo->ehash_locks)
  617. return -ENOMEM;
  618. for (i = 0; i < nblocks; i++)
  619. spin_lock_init(&hashinfo->ehash_locks[i]);
  620. }
  621. hashinfo->ehash_locks_mask = nblocks - 1;
  622. return 0;
  623. }
  624. EXPORT_SYMBOL_GPL(inet_ehash_locks_alloc);