connection.c 16 KB

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