connection.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485
  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 <net/inet_hashtables.h>
  36. #include "rds.h"
  37. #include "loop.h"
  38. #include "rdma.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 inline int rds_conn_is_sending(struct rds_connection *conn)
  60. {
  61. int ret = 0;
  62. if (!mutex_trylock(&conn->c_send_lock))
  63. ret = 1;
  64. else
  65. mutex_unlock(&conn->c_send_lock);
  66. return ret;
  67. }
  68. static struct rds_connection *rds_conn_lookup(struct hlist_head *head,
  69. __be32 laddr, __be32 faddr,
  70. struct rds_transport *trans)
  71. {
  72. struct rds_connection *conn, *ret = NULL;
  73. struct hlist_node *pos;
  74. hlist_for_each_entry(conn, pos, head, c_hash_node) {
  75. if (conn->c_faddr == faddr && conn->c_laddr == laddr &&
  76. conn->c_trans == trans) {
  77. ret = conn;
  78. break;
  79. }
  80. }
  81. rdsdebug("returning conn %p for %pI4 -> %pI4\n", ret,
  82. &laddr, &faddr);
  83. return ret;
  84. }
  85. /*
  86. * This is called by transports as they're bringing down a connection.
  87. * It clears partial message state so that the transport can start sending
  88. * and receiving over this connection again in the future. It is up to
  89. * the transport to have serialized this call with its send and recv.
  90. */
  91. void rds_conn_reset(struct rds_connection *conn)
  92. {
  93. rdsdebug("connection %pI4 to %pI4 reset\n",
  94. &conn->c_laddr, &conn->c_faddr);
  95. rds_stats_inc(s_conn_reset);
  96. rds_send_reset(conn);
  97. conn->c_flags = 0;
  98. /* Do not clear next_rx_seq here, else we cannot distinguish
  99. * retransmitted packets from new packets, and will hand all
  100. * of them to the application. That is not consistent with the
  101. * reliability guarantees of RDS. */
  102. }
  103. /*
  104. * There is only every one 'conn' for a given pair of addresses in the
  105. * system at a time. They contain messages to be retransmitted and so
  106. * span the lifetime of the actual underlying transport connections.
  107. *
  108. * For now they are not garbage collected once they're created. They
  109. * are torn down as the module is removed, if ever.
  110. */
  111. static struct rds_connection *__rds_conn_create(__be32 laddr, __be32 faddr,
  112. struct rds_transport *trans, gfp_t gfp,
  113. int is_outgoing)
  114. {
  115. struct rds_connection *conn, *tmp, *parent = NULL;
  116. struct hlist_head *head = rds_conn_bucket(laddr, faddr);
  117. unsigned long flags;
  118. int ret;
  119. spin_lock_irqsave(&rds_conn_lock, flags);
  120. conn = rds_conn_lookup(head, laddr, faddr, trans);
  121. if (conn
  122. && conn->c_loopback
  123. && conn->c_trans != &rds_loop_transport
  124. && !is_outgoing) {
  125. /* This is a looped back IB connection, and we're
  126. * called by the code handling the incoming connect.
  127. * We need a second connection object into which we
  128. * can stick the other QP. */
  129. parent = conn;
  130. conn = parent->c_passive;
  131. }
  132. spin_unlock_irqrestore(&rds_conn_lock, flags);
  133. if (conn)
  134. goto out;
  135. conn = kmem_cache_zalloc(rds_conn_slab, gfp);
  136. if (conn == NULL) {
  137. conn = ERR_PTR(-ENOMEM);
  138. goto out;
  139. }
  140. INIT_HLIST_NODE(&conn->c_hash_node);
  141. conn->c_version = RDS_PROTOCOL_3_0;
  142. conn->c_laddr = laddr;
  143. conn->c_faddr = faddr;
  144. spin_lock_init(&conn->c_lock);
  145. conn->c_next_tx_seq = 1;
  146. mutex_init(&conn->c_send_lock);
  147. INIT_LIST_HEAD(&conn->c_send_queue);
  148. INIT_LIST_HEAD(&conn->c_retrans);
  149. ret = rds_cong_get_maps(conn);
  150. if (ret) {
  151. kmem_cache_free(rds_conn_slab, conn);
  152. conn = ERR_PTR(ret);
  153. goto out;
  154. }
  155. /*
  156. * This is where a connection becomes loopback. If *any* RDS sockets
  157. * can bind to the destination address then we'd rather the messages
  158. * flow through loopback rather than either transport.
  159. */
  160. if (rds_trans_get_preferred(faddr)) {
  161. conn->c_loopback = 1;
  162. if (is_outgoing && trans->t_prefer_loopback) {
  163. /* "outgoing" connection - and the transport
  164. * says it wants the connection handled by the
  165. * loopback transport. This is what TCP does.
  166. */
  167. trans = &rds_loop_transport;
  168. }
  169. }
  170. conn->c_trans = trans;
  171. ret = trans->conn_alloc(conn, gfp);
  172. if (ret) {
  173. kmem_cache_free(rds_conn_slab, conn);
  174. conn = ERR_PTR(ret);
  175. goto out;
  176. }
  177. atomic_set(&conn->c_state, RDS_CONN_DOWN);
  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. spin_lock_irqsave(&rds_conn_lock, flags);
  190. if (parent == NULL) {
  191. tmp = rds_conn_lookup(head, laddr, faddr, trans);
  192. if (tmp == NULL)
  193. hlist_add_head(&conn->c_hash_node, head);
  194. } else {
  195. tmp = parent->c_passive;
  196. if (!tmp)
  197. parent->c_passive = conn;
  198. }
  199. if (tmp) {
  200. trans->conn_free(conn->c_transport_data);
  201. kmem_cache_free(rds_conn_slab, conn);
  202. conn = tmp;
  203. } else {
  204. rds_cong_add_conn(conn);
  205. rds_conn_count++;
  206. }
  207. spin_unlock_irqrestore(&rds_conn_lock, flags);
  208. out:
  209. return conn;
  210. }
  211. struct rds_connection *rds_conn_create(__be32 laddr, __be32 faddr,
  212. struct rds_transport *trans, gfp_t gfp)
  213. {
  214. return __rds_conn_create(laddr, faddr, trans, gfp, 0);
  215. }
  216. struct rds_connection *rds_conn_create_outgoing(__be32 laddr, __be32 faddr,
  217. struct rds_transport *trans, gfp_t gfp)
  218. {
  219. return __rds_conn_create(laddr, faddr, trans, gfp, 1);
  220. }
  221. void rds_conn_destroy(struct rds_connection *conn)
  222. {
  223. struct rds_message *rm, *rtmp;
  224. rdsdebug("freeing conn %p for %pI4 -> "
  225. "%pI4\n", conn, &conn->c_laddr,
  226. &conn->c_faddr);
  227. hlist_del_init(&conn->c_hash_node);
  228. /* wait for the rds thread to shut it down */
  229. atomic_set(&conn->c_state, RDS_CONN_ERROR);
  230. cancel_delayed_work(&conn->c_conn_w);
  231. queue_work(rds_wq, &conn->c_down_w);
  232. flush_workqueue(rds_wq);
  233. /* tear down queued messages */
  234. list_for_each_entry_safe(rm, rtmp,
  235. &conn->c_send_queue,
  236. m_conn_item) {
  237. list_del_init(&rm->m_conn_item);
  238. BUG_ON(!list_empty(&rm->m_sock_item));
  239. rds_message_put(rm);
  240. }
  241. if (conn->c_xmit_rm)
  242. rds_message_put(conn->c_xmit_rm);
  243. conn->c_trans->conn_free(conn->c_transport_data);
  244. /*
  245. * The congestion maps aren't freed up here. They're
  246. * freed by rds_cong_exit() after all the connections
  247. * have been freed.
  248. */
  249. rds_cong_remove_conn(conn);
  250. BUG_ON(!list_empty(&conn->c_retrans));
  251. kmem_cache_free(rds_conn_slab, conn);
  252. rds_conn_count--;
  253. }
  254. static void rds_conn_message_info(struct socket *sock, unsigned int len,
  255. struct rds_info_iterator *iter,
  256. struct rds_info_lengths *lens,
  257. int want_send)
  258. {
  259. struct hlist_head *head;
  260. struct hlist_node *pos;
  261. struct list_head *list;
  262. struct rds_connection *conn;
  263. struct rds_message *rm;
  264. unsigned long flags;
  265. unsigned int total = 0;
  266. size_t i;
  267. len /= sizeof(struct rds_info_message);
  268. spin_lock_irqsave(&rds_conn_lock, flags);
  269. for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash);
  270. i++, head++) {
  271. hlist_for_each_entry(conn, pos, head, c_hash_node) {
  272. if (want_send)
  273. list = &conn->c_send_queue;
  274. else
  275. list = &conn->c_retrans;
  276. spin_lock(&conn->c_lock);
  277. /* XXX too lazy to maintain counts.. */
  278. list_for_each_entry(rm, list, m_conn_item) {
  279. total++;
  280. if (total <= len)
  281. rds_inc_info_copy(&rm->m_inc, iter,
  282. conn->c_laddr,
  283. conn->c_faddr, 0);
  284. }
  285. spin_unlock(&conn->c_lock);
  286. }
  287. }
  288. spin_unlock_irqrestore(&rds_conn_lock, flags);
  289. lens->nr = total;
  290. lens->each = sizeof(struct rds_info_message);
  291. }
  292. static void rds_conn_message_info_send(struct socket *sock, unsigned int len,
  293. struct rds_info_iterator *iter,
  294. struct rds_info_lengths *lens)
  295. {
  296. rds_conn_message_info(sock, len, iter, lens, 1);
  297. }
  298. static void rds_conn_message_info_retrans(struct socket *sock,
  299. unsigned int len,
  300. struct rds_info_iterator *iter,
  301. struct rds_info_lengths *lens)
  302. {
  303. rds_conn_message_info(sock, len, iter, lens, 0);
  304. }
  305. void rds_for_each_conn_info(struct socket *sock, unsigned int len,
  306. struct rds_info_iterator *iter,
  307. struct rds_info_lengths *lens,
  308. int (*visitor)(struct rds_connection *, void *),
  309. size_t item_len)
  310. {
  311. uint64_t buffer[(item_len + 7) / 8];
  312. struct hlist_head *head;
  313. struct hlist_node *pos;
  314. struct hlist_node *tmp;
  315. struct rds_connection *conn;
  316. unsigned long flags;
  317. size_t i;
  318. spin_lock_irqsave(&rds_conn_lock, flags);
  319. lens->nr = 0;
  320. lens->each = item_len;
  321. for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash);
  322. i++, head++) {
  323. hlist_for_each_entry_safe(conn, pos, tmp, head, c_hash_node) {
  324. /* XXX no c_lock usage.. */
  325. if (!visitor(conn, buffer))
  326. continue;
  327. /* We copy as much as we can fit in the buffer,
  328. * but we count all items so that the caller
  329. * can resize the buffer. */
  330. if (len >= item_len) {
  331. rds_info_copy(iter, buffer, item_len);
  332. len -= item_len;
  333. }
  334. lens->nr++;
  335. }
  336. }
  337. spin_unlock_irqrestore(&rds_conn_lock, flags);
  338. }
  339. static int rds_conn_info_visitor(struct rds_connection *conn,
  340. void *buffer)
  341. {
  342. struct rds_info_connection *cinfo = buffer;
  343. cinfo->next_tx_seq = conn->c_next_tx_seq;
  344. cinfo->next_rx_seq = conn->c_next_rx_seq;
  345. cinfo->laddr = conn->c_laddr;
  346. cinfo->faddr = conn->c_faddr;
  347. strncpy(cinfo->transport, conn->c_trans->t_name,
  348. sizeof(cinfo->transport));
  349. cinfo->flags = 0;
  350. rds_conn_info_set(cinfo->flags,
  351. rds_conn_is_sending(conn), SENDING);
  352. /* XXX Future: return the state rather than these funky bits */
  353. rds_conn_info_set(cinfo->flags,
  354. atomic_read(&conn->c_state) == RDS_CONN_CONNECTING,
  355. CONNECTING);
  356. rds_conn_info_set(cinfo->flags,
  357. atomic_read(&conn->c_state) == RDS_CONN_UP,
  358. CONNECTED);
  359. return 1;
  360. }
  361. static void rds_conn_info(struct socket *sock, unsigned int len,
  362. struct rds_info_iterator *iter,
  363. struct rds_info_lengths *lens)
  364. {
  365. rds_for_each_conn_info(sock, len, iter, lens,
  366. rds_conn_info_visitor,
  367. sizeof(struct rds_info_connection));
  368. }
  369. int __init rds_conn_init(void)
  370. {
  371. rds_conn_slab = kmem_cache_create("rds_connection",
  372. sizeof(struct rds_connection),
  373. 0, 0, NULL);
  374. if (rds_conn_slab == NULL)
  375. return -ENOMEM;
  376. rds_info_register_func(RDS_INFO_CONNECTIONS, rds_conn_info);
  377. rds_info_register_func(RDS_INFO_SEND_MESSAGES,
  378. rds_conn_message_info_send);
  379. rds_info_register_func(RDS_INFO_RETRANS_MESSAGES,
  380. rds_conn_message_info_retrans);
  381. return 0;
  382. }
  383. void rds_conn_exit(void)
  384. {
  385. rds_loop_exit();
  386. WARN_ON(!hlist_empty(rds_conn_hash));
  387. kmem_cache_destroy(rds_conn_slab);
  388. rds_info_deregister_func(RDS_INFO_CONNECTIONS, rds_conn_info);
  389. rds_info_deregister_func(RDS_INFO_SEND_MESSAGES,
  390. rds_conn_message_info_send);
  391. rds_info_deregister_func(RDS_INFO_RETRANS_MESSAGES,
  392. rds_conn_message_info_retrans);
  393. }
  394. /*
  395. * Force a disconnect
  396. */
  397. void rds_conn_drop(struct rds_connection *conn)
  398. {
  399. atomic_set(&conn->c_state, RDS_CONN_ERROR);
  400. queue_work(rds_wq, &conn->c_down_w);
  401. }
  402. /*
  403. * An error occurred on the connection
  404. */
  405. void
  406. __rds_conn_error(struct rds_connection *conn, const char *fmt, ...)
  407. {
  408. va_list ap;
  409. va_start(ap, fmt);
  410. vprintk(fmt, ap);
  411. va_end(ap);
  412. rds_conn_drop(conn);
  413. }