connection.c 15 KB

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