connection.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588
  1. /*
  2. * Copyright (c) 2006 Oracle. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. *
  32. */
  33. #include <linux/kernel.h>
  34. #include <linux/list.h>
  35. #include <linux/slab.h>
  36. #include <linux/export.h>
  37. #include <net/inet_hashtables.h>
  38. #include "rds.h"
  39. #include "loop.h"
  40. #define RDS_CONNECTION_HASH_BITS 12
  41. #define RDS_CONNECTION_HASH_ENTRIES (1 << RDS_CONNECTION_HASH_BITS)
  42. #define RDS_CONNECTION_HASH_MASK (RDS_CONNECTION_HASH_ENTRIES - 1)
  43. /* converting this to RCU is a chore for another day.. */
  44. static DEFINE_SPINLOCK(rds_conn_lock);
  45. static unsigned long rds_conn_count;
  46. static struct hlist_head rds_conn_hash[RDS_CONNECTION_HASH_ENTRIES];
  47. static struct kmem_cache *rds_conn_slab;
  48. static struct hlist_head *rds_conn_bucket(__be32 laddr, __be32 faddr)
  49. {
  50. static u32 rds_hash_secret __read_mostly;
  51. unsigned long hash;
  52. net_get_random_once(&rds_hash_secret, sizeof(rds_hash_secret));
  53. /* Pass NULL, don't need struct net for hash */
  54. hash = __inet_ehashfn(be32_to_cpu(laddr), 0,
  55. be32_to_cpu(faddr), 0,
  56. rds_hash_secret);
  57. return &rds_conn_hash[hash & RDS_CONNECTION_HASH_MASK];
  58. }
  59. #define rds_conn_info_set(var, test, suffix) do { \
  60. if (test) \
  61. var |= RDS_INFO_CONNECTION_FLAG_##suffix; \
  62. } while (0)
  63. /* rcu read lock must be held or the connection spinlock */
  64. static struct rds_connection *rds_conn_lookup(struct net *net,
  65. struct hlist_head *head,
  66. __be32 laddr, __be32 faddr,
  67. struct rds_transport *trans)
  68. {
  69. struct rds_connection *conn, *ret = NULL;
  70. hlist_for_each_entry_rcu(conn, head, c_hash_node) {
  71. if (conn->c_faddr == faddr && conn->c_laddr == laddr &&
  72. conn->c_trans == trans && net == rds_conn_net(conn)) {
  73. ret = conn;
  74. break;
  75. }
  76. }
  77. rdsdebug("returning conn %p for %pI4 -> %pI4\n", ret,
  78. &laddr, &faddr);
  79. return ret;
  80. }
  81. /*
  82. * This is called by transports as they're bringing down a connection.
  83. * It clears partial message state so that the transport can start sending
  84. * and receiving over this connection again in the future. It is up to
  85. * the transport to have serialized this call with its send and recv.
  86. */
  87. static void rds_conn_reset(struct rds_connection *conn)
  88. {
  89. rdsdebug("connection %pI4 to %pI4 reset\n",
  90. &conn->c_laddr, &conn->c_faddr);
  91. rds_stats_inc(s_conn_reset);
  92. rds_send_reset(conn);
  93. conn->c_flags = 0;
  94. /* Do not clear next_rx_seq here, else we cannot distinguish
  95. * retransmitted packets from new packets, and will hand all
  96. * of them to the application. That is not consistent with the
  97. * reliability guarantees of RDS. */
  98. }
  99. /*
  100. * There is only every one 'conn' for a given pair of addresses in the
  101. * system at a time. They contain messages to be retransmitted and so
  102. * span the lifetime of the actual underlying transport connections.
  103. *
  104. * For now they are not garbage collected once they're created. They
  105. * are torn down as the module is removed, if ever.
  106. */
  107. static struct rds_connection *__rds_conn_create(struct net *net,
  108. __be32 laddr, __be32 faddr,
  109. struct rds_transport *trans, gfp_t gfp,
  110. int is_outgoing)
  111. {
  112. struct rds_connection *conn, *parent = NULL;
  113. struct hlist_head *head = rds_conn_bucket(laddr, faddr);
  114. struct rds_transport *loop_trans;
  115. unsigned long flags;
  116. int ret;
  117. rcu_read_lock();
  118. conn = rds_conn_lookup(net, head, laddr, faddr, trans);
  119. if (conn && conn->c_loopback && conn->c_trans != &rds_loop_transport &&
  120. laddr == faddr && !is_outgoing) {
  121. /* This is a looped back IB connection, and we're
  122. * called by the code handling the incoming connect.
  123. * We need a second connection object into which we
  124. * can stick the other QP. */
  125. parent = conn;
  126. conn = parent->c_passive;
  127. }
  128. rcu_read_unlock();
  129. if (conn)
  130. goto out;
  131. conn = kmem_cache_zalloc(rds_conn_slab, gfp);
  132. if (!conn) {
  133. conn = ERR_PTR(-ENOMEM);
  134. goto out;
  135. }
  136. INIT_HLIST_NODE(&conn->c_hash_node);
  137. conn->c_laddr = laddr;
  138. conn->c_faddr = faddr;
  139. spin_lock_init(&conn->c_lock);
  140. conn->c_next_tx_seq = 1;
  141. rds_conn_net_set(conn, net);
  142. init_waitqueue_head(&conn->c_waitq);
  143. INIT_LIST_HEAD(&conn->c_send_queue);
  144. INIT_LIST_HEAD(&conn->c_retrans);
  145. ret = rds_cong_get_maps(conn);
  146. if (ret) {
  147. kmem_cache_free(rds_conn_slab, conn);
  148. conn = ERR_PTR(ret);
  149. goto out;
  150. }
  151. /*
  152. * This is where a connection becomes loopback. If *any* RDS sockets
  153. * can bind to the destination address then we'd rather the messages
  154. * flow through loopback rather than either transport.
  155. */
  156. loop_trans = rds_trans_get_preferred(net, faddr);
  157. if (loop_trans) {
  158. rds_trans_put(loop_trans);
  159. conn->c_loopback = 1;
  160. if (is_outgoing && trans->t_prefer_loopback) {
  161. /* "outgoing" connection - and the transport
  162. * says it wants the connection handled by the
  163. * loopback transport. This is what TCP does.
  164. */
  165. trans = &rds_loop_transport;
  166. }
  167. }
  168. conn->c_trans = trans;
  169. ret = trans->conn_alloc(conn, gfp);
  170. if (ret) {
  171. kmem_cache_free(rds_conn_slab, conn);
  172. conn = ERR_PTR(ret);
  173. goto out;
  174. }
  175. atomic_set(&conn->c_state, RDS_CONN_DOWN);
  176. conn->c_send_gen = 0;
  177. conn->c_outgoing = (is_outgoing ? 1 : 0);
  178. conn->c_reconnect_jiffies = 0;
  179. INIT_DELAYED_WORK(&conn->c_send_w, rds_send_worker);
  180. INIT_DELAYED_WORK(&conn->c_recv_w, rds_recv_worker);
  181. INIT_DELAYED_WORK(&conn->c_conn_w, rds_connect_worker);
  182. INIT_WORK(&conn->c_down_w, rds_shutdown_worker);
  183. mutex_init(&conn->c_cm_lock);
  184. conn->c_flags = 0;
  185. rdsdebug("allocated conn %p for %pI4 -> %pI4 over %s %s\n",
  186. conn, &laddr, &faddr,
  187. trans->t_name ? trans->t_name : "[unknown]",
  188. is_outgoing ? "(outgoing)" : "");
  189. /*
  190. * Since we ran without holding the conn lock, someone could
  191. * have created the same conn (either normal or passive) in the
  192. * interim. We check while holding the lock. If we won, we complete
  193. * init and return our conn. If we lost, we rollback and return the
  194. * other one.
  195. */
  196. spin_lock_irqsave(&rds_conn_lock, flags);
  197. if (parent) {
  198. /* Creating passive conn */
  199. if (parent->c_passive) {
  200. trans->conn_free(conn->c_transport_data);
  201. kmem_cache_free(rds_conn_slab, conn);
  202. conn = parent->c_passive;
  203. } else {
  204. parent->c_passive = conn;
  205. rds_cong_add_conn(conn);
  206. rds_conn_count++;
  207. }
  208. } else {
  209. /* Creating normal conn */
  210. struct rds_connection *found;
  211. found = rds_conn_lookup(net, head, laddr, faddr, trans);
  212. if (found) {
  213. trans->conn_free(conn->c_transport_data);
  214. kmem_cache_free(rds_conn_slab, conn);
  215. conn = found;
  216. } else {
  217. hlist_add_head_rcu(&conn->c_hash_node, head);
  218. rds_cong_add_conn(conn);
  219. rds_conn_count++;
  220. }
  221. }
  222. spin_unlock_irqrestore(&rds_conn_lock, flags);
  223. out:
  224. return conn;
  225. }
  226. struct rds_connection *rds_conn_create(struct net *net,
  227. __be32 laddr, __be32 faddr,
  228. struct rds_transport *trans, gfp_t gfp)
  229. {
  230. return __rds_conn_create(net, laddr, faddr, trans, gfp, 0);
  231. }
  232. EXPORT_SYMBOL_GPL(rds_conn_create);
  233. struct rds_connection *rds_conn_create_outgoing(struct net *net,
  234. __be32 laddr, __be32 faddr,
  235. struct rds_transport *trans, gfp_t gfp)
  236. {
  237. return __rds_conn_create(net, laddr, faddr, trans, gfp, 1);
  238. }
  239. EXPORT_SYMBOL_GPL(rds_conn_create_outgoing);
  240. void rds_conn_shutdown(struct rds_connection *conn)
  241. {
  242. /* shut it down unless it's down already */
  243. if (!rds_conn_transition(conn, RDS_CONN_DOWN, RDS_CONN_DOWN)) {
  244. /*
  245. * Quiesce the connection mgmt handlers before we start tearing
  246. * things down. We don't hold the mutex for the entire
  247. * duration of the shutdown operation, else we may be
  248. * deadlocking with the CM handler. Instead, the CM event
  249. * handler is supposed to check for state DISCONNECTING
  250. */
  251. mutex_lock(&conn->c_cm_lock);
  252. if (!rds_conn_transition(conn, RDS_CONN_UP, RDS_CONN_DISCONNECTING)
  253. && !rds_conn_transition(conn, RDS_CONN_ERROR, RDS_CONN_DISCONNECTING)) {
  254. rds_conn_error(conn, "shutdown called in state %d\n",
  255. atomic_read(&conn->c_state));
  256. mutex_unlock(&conn->c_cm_lock);
  257. return;
  258. }
  259. mutex_unlock(&conn->c_cm_lock);
  260. wait_event(conn->c_waitq,
  261. !test_bit(RDS_IN_XMIT, &conn->c_flags));
  262. wait_event(conn->c_waitq,
  263. !test_bit(RDS_RECV_REFILL, &conn->c_flags));
  264. conn->c_trans->conn_shutdown(conn);
  265. rds_conn_reset(conn);
  266. if (!rds_conn_transition(conn, RDS_CONN_DISCONNECTING, RDS_CONN_DOWN)) {
  267. /* This can happen - eg when we're in the middle of tearing
  268. * down the connection, and someone unloads the rds module.
  269. * Quite reproduceable with loopback connections.
  270. * Mostly harmless.
  271. */
  272. rds_conn_error(conn,
  273. "%s: failed to transition to state DOWN, "
  274. "current state is %d\n",
  275. __func__,
  276. atomic_read(&conn->c_state));
  277. return;
  278. }
  279. }
  280. /* Then reconnect if it's still live.
  281. * The passive side of an IB loopback connection is never added
  282. * to the conn hash, so we never trigger a reconnect on this
  283. * conn - the reconnect is always triggered by the active peer. */
  284. cancel_delayed_work_sync(&conn->c_conn_w);
  285. rcu_read_lock();
  286. if (!hlist_unhashed(&conn->c_hash_node)) {
  287. rcu_read_unlock();
  288. if (conn->c_trans->t_type != RDS_TRANS_TCP ||
  289. conn->c_outgoing == 1)
  290. rds_queue_reconnect(conn);
  291. } else {
  292. rcu_read_unlock();
  293. }
  294. }
  295. /*
  296. * Stop and free a connection.
  297. *
  298. * This can only be used in very limited circumstances. It assumes that once
  299. * the conn has been shutdown that no one else is referencing the connection.
  300. * We can only ensure this in the rmmod path in the current code.
  301. */
  302. void rds_conn_destroy(struct rds_connection *conn)
  303. {
  304. struct rds_message *rm, *rtmp;
  305. unsigned long flags;
  306. rdsdebug("freeing conn %p for %pI4 -> "
  307. "%pI4\n", conn, &conn->c_laddr,
  308. &conn->c_faddr);
  309. /* Ensure conn will not be scheduled for reconnect */
  310. spin_lock_irq(&rds_conn_lock);
  311. hlist_del_init_rcu(&conn->c_hash_node);
  312. spin_unlock_irq(&rds_conn_lock);
  313. synchronize_rcu();
  314. /* shut the connection down */
  315. rds_conn_drop(conn);
  316. flush_work(&conn->c_down_w);
  317. /* make sure lingering queued work won't try to ref the conn */
  318. cancel_delayed_work_sync(&conn->c_send_w);
  319. cancel_delayed_work_sync(&conn->c_recv_w);
  320. /* tear down queued messages */
  321. list_for_each_entry_safe(rm, rtmp,
  322. &conn->c_send_queue,
  323. m_conn_item) {
  324. list_del_init(&rm->m_conn_item);
  325. BUG_ON(!list_empty(&rm->m_sock_item));
  326. rds_message_put(rm);
  327. }
  328. if (conn->c_xmit_rm)
  329. rds_message_put(conn->c_xmit_rm);
  330. conn->c_trans->conn_free(conn->c_transport_data);
  331. /*
  332. * The congestion maps aren't freed up here. They're
  333. * freed by rds_cong_exit() after all the connections
  334. * have been freed.
  335. */
  336. rds_cong_remove_conn(conn);
  337. BUG_ON(!list_empty(&conn->c_retrans));
  338. kmem_cache_free(rds_conn_slab, conn);
  339. spin_lock_irqsave(&rds_conn_lock, flags);
  340. rds_conn_count--;
  341. spin_unlock_irqrestore(&rds_conn_lock, flags);
  342. }
  343. EXPORT_SYMBOL_GPL(rds_conn_destroy);
  344. static void rds_conn_message_info(struct socket *sock, unsigned int len,
  345. struct rds_info_iterator *iter,
  346. struct rds_info_lengths *lens,
  347. int want_send)
  348. {
  349. struct hlist_head *head;
  350. struct list_head *list;
  351. struct rds_connection *conn;
  352. struct rds_message *rm;
  353. unsigned int total = 0;
  354. unsigned long flags;
  355. size_t i;
  356. len /= sizeof(struct rds_info_message);
  357. rcu_read_lock();
  358. for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash);
  359. i++, head++) {
  360. hlist_for_each_entry_rcu(conn, head, c_hash_node) {
  361. if (want_send)
  362. list = &conn->c_send_queue;
  363. else
  364. list = &conn->c_retrans;
  365. spin_lock_irqsave(&conn->c_lock, flags);
  366. /* XXX too lazy to maintain counts.. */
  367. list_for_each_entry(rm, list, m_conn_item) {
  368. total++;
  369. if (total <= len)
  370. rds_inc_info_copy(&rm->m_inc, iter,
  371. conn->c_laddr,
  372. conn->c_faddr, 0);
  373. }
  374. spin_unlock_irqrestore(&conn->c_lock, flags);
  375. }
  376. }
  377. rcu_read_unlock();
  378. lens->nr = total;
  379. lens->each = sizeof(struct rds_info_message);
  380. }
  381. static void rds_conn_message_info_send(struct socket *sock, unsigned int len,
  382. struct rds_info_iterator *iter,
  383. struct rds_info_lengths *lens)
  384. {
  385. rds_conn_message_info(sock, len, iter, lens, 1);
  386. }
  387. static void rds_conn_message_info_retrans(struct socket *sock,
  388. unsigned int len,
  389. struct rds_info_iterator *iter,
  390. struct rds_info_lengths *lens)
  391. {
  392. rds_conn_message_info(sock, len, iter, lens, 0);
  393. }
  394. void rds_for_each_conn_info(struct socket *sock, unsigned int len,
  395. struct rds_info_iterator *iter,
  396. struct rds_info_lengths *lens,
  397. int (*visitor)(struct rds_connection *, void *),
  398. size_t item_len)
  399. {
  400. uint64_t buffer[(item_len + 7) / 8];
  401. struct hlist_head *head;
  402. struct rds_connection *conn;
  403. size_t i;
  404. rcu_read_lock();
  405. lens->nr = 0;
  406. lens->each = item_len;
  407. for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash);
  408. i++, head++) {
  409. hlist_for_each_entry_rcu(conn, head, c_hash_node) {
  410. /* XXX no c_lock usage.. */
  411. if (!visitor(conn, buffer))
  412. continue;
  413. /* We copy as much as we can fit in the buffer,
  414. * but we count all items so that the caller
  415. * can resize the buffer. */
  416. if (len >= item_len) {
  417. rds_info_copy(iter, buffer, item_len);
  418. len -= item_len;
  419. }
  420. lens->nr++;
  421. }
  422. }
  423. rcu_read_unlock();
  424. }
  425. EXPORT_SYMBOL_GPL(rds_for_each_conn_info);
  426. static int rds_conn_info_visitor(struct rds_connection *conn,
  427. void *buffer)
  428. {
  429. struct rds_info_connection *cinfo = buffer;
  430. cinfo->next_tx_seq = conn->c_next_tx_seq;
  431. cinfo->next_rx_seq = conn->c_next_rx_seq;
  432. cinfo->laddr = conn->c_laddr;
  433. cinfo->faddr = conn->c_faddr;
  434. strncpy(cinfo->transport, conn->c_trans->t_name,
  435. sizeof(cinfo->transport));
  436. cinfo->flags = 0;
  437. rds_conn_info_set(cinfo->flags, test_bit(RDS_IN_XMIT, &conn->c_flags),
  438. SENDING);
  439. /* XXX Future: return the state rather than these funky bits */
  440. rds_conn_info_set(cinfo->flags,
  441. atomic_read(&conn->c_state) == RDS_CONN_CONNECTING,
  442. CONNECTING);
  443. rds_conn_info_set(cinfo->flags,
  444. atomic_read(&conn->c_state) == RDS_CONN_UP,
  445. CONNECTED);
  446. return 1;
  447. }
  448. static void rds_conn_info(struct socket *sock, unsigned int len,
  449. struct rds_info_iterator *iter,
  450. struct rds_info_lengths *lens)
  451. {
  452. rds_for_each_conn_info(sock, len, iter, lens,
  453. rds_conn_info_visitor,
  454. sizeof(struct rds_info_connection));
  455. }
  456. int rds_conn_init(void)
  457. {
  458. rds_conn_slab = kmem_cache_create("rds_connection",
  459. sizeof(struct rds_connection),
  460. 0, 0, NULL);
  461. if (!rds_conn_slab)
  462. return -ENOMEM;
  463. rds_info_register_func(RDS_INFO_CONNECTIONS, rds_conn_info);
  464. rds_info_register_func(RDS_INFO_SEND_MESSAGES,
  465. rds_conn_message_info_send);
  466. rds_info_register_func(RDS_INFO_RETRANS_MESSAGES,
  467. rds_conn_message_info_retrans);
  468. return 0;
  469. }
  470. void rds_conn_exit(void)
  471. {
  472. rds_loop_exit();
  473. WARN_ON(!hlist_empty(rds_conn_hash));
  474. kmem_cache_destroy(rds_conn_slab);
  475. rds_info_deregister_func(RDS_INFO_CONNECTIONS, rds_conn_info);
  476. rds_info_deregister_func(RDS_INFO_SEND_MESSAGES,
  477. rds_conn_message_info_send);
  478. rds_info_deregister_func(RDS_INFO_RETRANS_MESSAGES,
  479. rds_conn_message_info_retrans);
  480. }
  481. /*
  482. * Force a disconnect
  483. */
  484. void rds_conn_drop(struct rds_connection *conn)
  485. {
  486. atomic_set(&conn->c_state, RDS_CONN_ERROR);
  487. queue_work(rds_wq, &conn->c_down_w);
  488. }
  489. EXPORT_SYMBOL_GPL(rds_conn_drop);
  490. /*
  491. * If the connection is down, trigger a connect. We may have scheduled a
  492. * delayed reconnect however - in this case we should not interfere.
  493. */
  494. void rds_conn_connect_if_down(struct rds_connection *conn)
  495. {
  496. if (rds_conn_state(conn) == RDS_CONN_DOWN &&
  497. !test_and_set_bit(RDS_RECONNECT_PENDING, &conn->c_flags))
  498. queue_delayed_work(rds_wq, &conn->c_conn_w, 0);
  499. }
  500. EXPORT_SYMBOL_GPL(rds_conn_connect_if_down);
  501. /*
  502. * An error occurred on the connection
  503. */
  504. void
  505. __rds_conn_error(struct rds_connection *conn, const char *fmt, ...)
  506. {
  507. va_list ap;
  508. va_start(ap, fmt);
  509. vprintk(fmt, ap);
  510. va_end(ap);
  511. rds_conn_drop(conn);
  512. }