connection.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751
  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_path_reset(struct rds_conn_path *cp)
  88. {
  89. struct rds_connection *conn = cp->cp_conn;
  90. rdsdebug("connection %pI4 to %pI4 reset\n",
  91. &conn->c_laddr, &conn->c_faddr);
  92. rds_stats_inc(s_conn_reset);
  93. rds_send_path_reset(cp);
  94. cp->cp_flags = 0;
  95. /* Do not clear next_rx_seq here, else we cannot distinguish
  96. * retransmitted packets from new packets, and will hand all
  97. * of them to the application. That is not consistent with the
  98. * reliability guarantees of RDS. */
  99. }
  100. static void __rds_conn_path_init(struct rds_connection *conn,
  101. struct rds_conn_path *cp, bool is_outgoing)
  102. {
  103. spin_lock_init(&cp->cp_lock);
  104. cp->cp_next_tx_seq = 1;
  105. init_waitqueue_head(&cp->cp_waitq);
  106. INIT_LIST_HEAD(&cp->cp_send_queue);
  107. INIT_LIST_HEAD(&cp->cp_retrans);
  108. cp->cp_conn = conn;
  109. atomic_set(&cp->cp_state, RDS_CONN_DOWN);
  110. cp->cp_send_gen = 0;
  111. cp->cp_reconnect_jiffies = 0;
  112. INIT_DELAYED_WORK(&cp->cp_send_w, rds_send_worker);
  113. INIT_DELAYED_WORK(&cp->cp_recv_w, rds_recv_worker);
  114. INIT_DELAYED_WORK(&cp->cp_conn_w, rds_connect_worker);
  115. INIT_WORK(&cp->cp_down_w, rds_shutdown_worker);
  116. mutex_init(&cp->cp_cm_lock);
  117. cp->cp_flags = 0;
  118. }
  119. /*
  120. * There is only every one 'conn' for a given pair of addresses in the
  121. * system at a time. They contain messages to be retransmitted and so
  122. * span the lifetime of the actual underlying transport connections.
  123. *
  124. * For now they are not garbage collected once they're created. They
  125. * are torn down as the module is removed, if ever.
  126. */
  127. static struct rds_connection *__rds_conn_create(struct net *net,
  128. __be32 laddr, __be32 faddr,
  129. struct rds_transport *trans, gfp_t gfp,
  130. int is_outgoing)
  131. {
  132. struct rds_connection *conn, *parent = NULL;
  133. struct hlist_head *head = rds_conn_bucket(laddr, faddr);
  134. struct rds_transport *loop_trans;
  135. unsigned long flags;
  136. int ret, i;
  137. int npaths = (trans->t_mp_capable ? RDS_MPATH_WORKERS : 1);
  138. rcu_read_lock();
  139. conn = rds_conn_lookup(net, head, laddr, faddr, trans);
  140. if (conn && conn->c_loopback && conn->c_trans != &rds_loop_transport &&
  141. laddr == faddr && !is_outgoing) {
  142. /* This is a looped back IB connection, and we're
  143. * called by the code handling the incoming connect.
  144. * We need a second connection object into which we
  145. * can stick the other QP. */
  146. parent = conn;
  147. conn = parent->c_passive;
  148. }
  149. rcu_read_unlock();
  150. if (conn)
  151. goto out;
  152. conn = kmem_cache_zalloc(rds_conn_slab, gfp);
  153. if (!conn) {
  154. conn = ERR_PTR(-ENOMEM);
  155. goto out;
  156. }
  157. conn->c_path = kcalloc(npaths, sizeof(struct rds_conn_path), gfp);
  158. if (!conn->c_path) {
  159. kmem_cache_free(rds_conn_slab, conn);
  160. conn = ERR_PTR(-ENOMEM);
  161. goto out;
  162. }
  163. INIT_HLIST_NODE(&conn->c_hash_node);
  164. conn->c_laddr = laddr;
  165. conn->c_faddr = faddr;
  166. rds_conn_net_set(conn, net);
  167. ret = rds_cong_get_maps(conn);
  168. if (ret) {
  169. kfree(conn->c_path);
  170. kmem_cache_free(rds_conn_slab, conn);
  171. conn = ERR_PTR(ret);
  172. goto out;
  173. }
  174. /*
  175. * This is where a connection becomes loopback. If *any* RDS sockets
  176. * can bind to the destination address then we'd rather the messages
  177. * flow through loopback rather than either transport.
  178. */
  179. loop_trans = rds_trans_get_preferred(net, faddr);
  180. if (loop_trans) {
  181. rds_trans_put(loop_trans);
  182. conn->c_loopback = 1;
  183. if (is_outgoing && trans->t_prefer_loopback) {
  184. /* "outgoing" connection - and the transport
  185. * says it wants the connection handled by the
  186. * loopback transport. This is what TCP does.
  187. */
  188. trans = &rds_loop_transport;
  189. }
  190. }
  191. conn->c_trans = trans;
  192. init_waitqueue_head(&conn->c_hs_waitq);
  193. for (i = 0; i < npaths; i++) {
  194. __rds_conn_path_init(conn, &conn->c_path[i],
  195. is_outgoing);
  196. conn->c_path[i].cp_index = i;
  197. }
  198. rcu_read_lock();
  199. if (rds_destroy_pending(conn))
  200. ret = -ENETDOWN;
  201. else
  202. ret = trans->conn_alloc(conn, GFP_ATOMIC);
  203. if (ret) {
  204. rcu_read_unlock();
  205. kfree(conn->c_path);
  206. kmem_cache_free(rds_conn_slab, conn);
  207. conn = ERR_PTR(ret);
  208. goto out;
  209. }
  210. rdsdebug("allocated conn %p for %pI4 -> %pI4 over %s %s\n",
  211. conn, &laddr, &faddr,
  212. strnlen(trans->t_name, sizeof(trans->t_name)) ? trans->t_name :
  213. "[unknown]", is_outgoing ? "(outgoing)" : "");
  214. /*
  215. * Since we ran without holding the conn lock, someone could
  216. * have created the same conn (either normal or passive) in the
  217. * interim. We check while holding the lock. If we won, we complete
  218. * init and return our conn. If we lost, we rollback and return the
  219. * other one.
  220. */
  221. spin_lock_irqsave(&rds_conn_lock, flags);
  222. if (parent) {
  223. /* Creating passive conn */
  224. if (parent->c_passive) {
  225. trans->conn_free(conn->c_path[0].cp_transport_data);
  226. kfree(conn->c_path);
  227. kmem_cache_free(rds_conn_slab, conn);
  228. conn = parent->c_passive;
  229. } else {
  230. parent->c_passive = conn;
  231. rds_cong_add_conn(conn);
  232. rds_conn_count++;
  233. }
  234. } else {
  235. /* Creating normal conn */
  236. struct rds_connection *found;
  237. found = rds_conn_lookup(net, head, laddr, faddr, trans);
  238. if (found) {
  239. struct rds_conn_path *cp;
  240. int i;
  241. for (i = 0; i < npaths; i++) {
  242. cp = &conn->c_path[i];
  243. /* The ->conn_alloc invocation may have
  244. * allocated resource for all paths, so all
  245. * of them may have to be freed here.
  246. */
  247. if (cp->cp_transport_data)
  248. trans->conn_free(cp->cp_transport_data);
  249. }
  250. kfree(conn->c_path);
  251. kmem_cache_free(rds_conn_slab, conn);
  252. conn = found;
  253. } else {
  254. conn->c_my_gen_num = rds_gen_num;
  255. conn->c_peer_gen_num = 0;
  256. hlist_add_head_rcu(&conn->c_hash_node, head);
  257. rds_cong_add_conn(conn);
  258. rds_conn_count++;
  259. }
  260. }
  261. spin_unlock_irqrestore(&rds_conn_lock, flags);
  262. rcu_read_unlock();
  263. out:
  264. return conn;
  265. }
  266. struct rds_connection *rds_conn_create(struct net *net,
  267. __be32 laddr, __be32 faddr,
  268. struct rds_transport *trans, gfp_t gfp)
  269. {
  270. return __rds_conn_create(net, laddr, faddr, trans, gfp, 0);
  271. }
  272. EXPORT_SYMBOL_GPL(rds_conn_create);
  273. struct rds_connection *rds_conn_create_outgoing(struct net *net,
  274. __be32 laddr, __be32 faddr,
  275. struct rds_transport *trans, gfp_t gfp)
  276. {
  277. return __rds_conn_create(net, laddr, faddr, trans, gfp, 1);
  278. }
  279. EXPORT_SYMBOL_GPL(rds_conn_create_outgoing);
  280. void rds_conn_shutdown(struct rds_conn_path *cp)
  281. {
  282. struct rds_connection *conn = cp->cp_conn;
  283. /* shut it down unless it's down already */
  284. if (!rds_conn_path_transition(cp, RDS_CONN_DOWN, RDS_CONN_DOWN)) {
  285. /*
  286. * Quiesce the connection mgmt handlers before we start tearing
  287. * things down. We don't hold the mutex for the entire
  288. * duration of the shutdown operation, else we may be
  289. * deadlocking with the CM handler. Instead, the CM event
  290. * handler is supposed to check for state DISCONNECTING
  291. */
  292. mutex_lock(&cp->cp_cm_lock);
  293. if (!rds_conn_path_transition(cp, RDS_CONN_UP,
  294. RDS_CONN_DISCONNECTING) &&
  295. !rds_conn_path_transition(cp, RDS_CONN_ERROR,
  296. RDS_CONN_DISCONNECTING)) {
  297. rds_conn_path_error(cp,
  298. "shutdown called in state %d\n",
  299. atomic_read(&cp->cp_state));
  300. mutex_unlock(&cp->cp_cm_lock);
  301. return;
  302. }
  303. mutex_unlock(&cp->cp_cm_lock);
  304. wait_event(cp->cp_waitq,
  305. !test_bit(RDS_IN_XMIT, &cp->cp_flags));
  306. wait_event(cp->cp_waitq,
  307. !test_bit(RDS_RECV_REFILL, &cp->cp_flags));
  308. conn->c_trans->conn_path_shutdown(cp);
  309. rds_conn_path_reset(cp);
  310. if (!rds_conn_path_transition(cp, RDS_CONN_DISCONNECTING,
  311. RDS_CONN_DOWN) &&
  312. !rds_conn_path_transition(cp, RDS_CONN_ERROR,
  313. RDS_CONN_DOWN)) {
  314. /* This can happen - eg when we're in the middle of tearing
  315. * down the connection, and someone unloads the rds module.
  316. * Quite reproducible with loopback connections.
  317. * Mostly harmless.
  318. *
  319. * Note that this also happens with rds-tcp because
  320. * we could have triggered rds_conn_path_drop in irq
  321. * mode from rds_tcp_state change on the receipt of
  322. * a FIN, thus we need to recheck for RDS_CONN_ERROR
  323. * here.
  324. */
  325. rds_conn_path_error(cp, "%s: failed to transition "
  326. "to state DOWN, current state "
  327. "is %d\n", __func__,
  328. atomic_read(&cp->cp_state));
  329. return;
  330. }
  331. }
  332. /* Then reconnect if it's still live.
  333. * The passive side of an IB loopback connection is never added
  334. * to the conn hash, so we never trigger a reconnect on this
  335. * conn - the reconnect is always triggered by the active peer. */
  336. cancel_delayed_work_sync(&cp->cp_conn_w);
  337. rcu_read_lock();
  338. if (!hlist_unhashed(&conn->c_hash_node)) {
  339. rcu_read_unlock();
  340. rds_queue_reconnect(cp);
  341. } else {
  342. rcu_read_unlock();
  343. }
  344. }
  345. /* destroy a single rds_conn_path. rds_conn_destroy() iterates over
  346. * all paths using rds_conn_path_destroy()
  347. */
  348. static void rds_conn_path_destroy(struct rds_conn_path *cp)
  349. {
  350. struct rds_message *rm, *rtmp;
  351. if (!cp->cp_transport_data)
  352. return;
  353. /* make sure lingering queued work won't try to ref the conn */
  354. cancel_delayed_work_sync(&cp->cp_send_w);
  355. cancel_delayed_work_sync(&cp->cp_recv_w);
  356. rds_conn_path_drop(cp, true);
  357. flush_work(&cp->cp_down_w);
  358. /* tear down queued messages */
  359. list_for_each_entry_safe(rm, rtmp,
  360. &cp->cp_send_queue,
  361. m_conn_item) {
  362. list_del_init(&rm->m_conn_item);
  363. BUG_ON(!list_empty(&rm->m_sock_item));
  364. rds_message_put(rm);
  365. }
  366. if (cp->cp_xmit_rm)
  367. rds_message_put(cp->cp_xmit_rm);
  368. WARN_ON(delayed_work_pending(&cp->cp_send_w));
  369. WARN_ON(delayed_work_pending(&cp->cp_recv_w));
  370. WARN_ON(delayed_work_pending(&cp->cp_conn_w));
  371. WARN_ON(work_pending(&cp->cp_down_w));
  372. cp->cp_conn->c_trans->conn_free(cp->cp_transport_data);
  373. }
  374. /*
  375. * Stop and free a connection.
  376. *
  377. * This can only be used in very limited circumstances. It assumes that once
  378. * the conn has been shutdown that no one else is referencing the connection.
  379. * We can only ensure this in the rmmod path in the current code.
  380. */
  381. void rds_conn_destroy(struct rds_connection *conn)
  382. {
  383. unsigned long flags;
  384. int i;
  385. struct rds_conn_path *cp;
  386. int npaths = (conn->c_trans->t_mp_capable ? RDS_MPATH_WORKERS : 1);
  387. rdsdebug("freeing conn %p for %pI4 -> "
  388. "%pI4\n", conn, &conn->c_laddr,
  389. &conn->c_faddr);
  390. /* Ensure conn will not be scheduled for reconnect */
  391. spin_lock_irq(&rds_conn_lock);
  392. hlist_del_init_rcu(&conn->c_hash_node);
  393. spin_unlock_irq(&rds_conn_lock);
  394. synchronize_rcu();
  395. /* shut the connection down */
  396. for (i = 0; i < npaths; i++) {
  397. cp = &conn->c_path[i];
  398. rds_conn_path_destroy(cp);
  399. BUG_ON(!list_empty(&cp->cp_retrans));
  400. }
  401. /*
  402. * The congestion maps aren't freed up here. They're
  403. * freed by rds_cong_exit() after all the connections
  404. * have been freed.
  405. */
  406. rds_cong_remove_conn(conn);
  407. kfree(conn->c_path);
  408. kmem_cache_free(rds_conn_slab, conn);
  409. spin_lock_irqsave(&rds_conn_lock, flags);
  410. rds_conn_count--;
  411. spin_unlock_irqrestore(&rds_conn_lock, flags);
  412. }
  413. EXPORT_SYMBOL_GPL(rds_conn_destroy);
  414. static void rds_conn_message_info(struct socket *sock, unsigned int len,
  415. struct rds_info_iterator *iter,
  416. struct rds_info_lengths *lens,
  417. int want_send)
  418. {
  419. struct hlist_head *head;
  420. struct list_head *list;
  421. struct rds_connection *conn;
  422. struct rds_message *rm;
  423. unsigned int total = 0;
  424. unsigned long flags;
  425. size_t i;
  426. int j;
  427. len /= sizeof(struct rds_info_message);
  428. rcu_read_lock();
  429. for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash);
  430. i++, head++) {
  431. hlist_for_each_entry_rcu(conn, head, c_hash_node) {
  432. struct rds_conn_path *cp;
  433. int npaths;
  434. npaths = (conn->c_trans->t_mp_capable ?
  435. RDS_MPATH_WORKERS : 1);
  436. for (j = 0; j < npaths; j++) {
  437. cp = &conn->c_path[j];
  438. if (want_send)
  439. list = &cp->cp_send_queue;
  440. else
  441. list = &cp->cp_retrans;
  442. spin_lock_irqsave(&cp->cp_lock, flags);
  443. /* XXX too lazy to maintain counts.. */
  444. list_for_each_entry(rm, list, m_conn_item) {
  445. total++;
  446. if (total <= len)
  447. rds_inc_info_copy(&rm->m_inc,
  448. iter,
  449. conn->c_laddr,
  450. conn->c_faddr,
  451. 0);
  452. }
  453. spin_unlock_irqrestore(&cp->cp_lock, flags);
  454. }
  455. }
  456. }
  457. rcu_read_unlock();
  458. lens->nr = total;
  459. lens->each = sizeof(struct rds_info_message);
  460. }
  461. static void rds_conn_message_info_send(struct socket *sock, unsigned int len,
  462. struct rds_info_iterator *iter,
  463. struct rds_info_lengths *lens)
  464. {
  465. rds_conn_message_info(sock, len, iter, lens, 1);
  466. }
  467. static void rds_conn_message_info_retrans(struct socket *sock,
  468. unsigned int len,
  469. struct rds_info_iterator *iter,
  470. struct rds_info_lengths *lens)
  471. {
  472. rds_conn_message_info(sock, len, iter, lens, 0);
  473. }
  474. void rds_for_each_conn_info(struct socket *sock, unsigned int len,
  475. struct rds_info_iterator *iter,
  476. struct rds_info_lengths *lens,
  477. int (*visitor)(struct rds_connection *, void *),
  478. u64 *buffer,
  479. size_t item_len)
  480. {
  481. struct hlist_head *head;
  482. struct rds_connection *conn;
  483. size_t i;
  484. rcu_read_lock();
  485. lens->nr = 0;
  486. lens->each = item_len;
  487. for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash);
  488. i++, head++) {
  489. hlist_for_each_entry_rcu(conn, head, c_hash_node) {
  490. /* XXX no c_lock usage.. */
  491. if (!visitor(conn, buffer))
  492. continue;
  493. /* We copy as much as we can fit in the buffer,
  494. * but we count all items so that the caller
  495. * can resize the buffer. */
  496. if (len >= item_len) {
  497. rds_info_copy(iter, buffer, item_len);
  498. len -= item_len;
  499. }
  500. lens->nr++;
  501. }
  502. }
  503. rcu_read_unlock();
  504. }
  505. EXPORT_SYMBOL_GPL(rds_for_each_conn_info);
  506. static void rds_walk_conn_path_info(struct socket *sock, unsigned int len,
  507. struct rds_info_iterator *iter,
  508. struct rds_info_lengths *lens,
  509. int (*visitor)(struct rds_conn_path *, void *),
  510. u64 *buffer,
  511. size_t item_len)
  512. {
  513. struct hlist_head *head;
  514. struct rds_connection *conn;
  515. size_t i;
  516. int j;
  517. rcu_read_lock();
  518. lens->nr = 0;
  519. lens->each = item_len;
  520. for (i = 0, head = rds_conn_hash; i < ARRAY_SIZE(rds_conn_hash);
  521. i++, head++) {
  522. hlist_for_each_entry_rcu(conn, head, c_hash_node) {
  523. struct rds_conn_path *cp;
  524. int npaths;
  525. npaths = (conn->c_trans->t_mp_capable ?
  526. RDS_MPATH_WORKERS : 1);
  527. for (j = 0; j < npaths; j++) {
  528. cp = &conn->c_path[j];
  529. /* XXX no cp_lock usage.. */
  530. if (!visitor(cp, buffer))
  531. continue;
  532. }
  533. /* We copy as much as we can fit in the buffer,
  534. * but we count all items so that the caller
  535. * can resize the buffer.
  536. */
  537. if (len >= item_len) {
  538. rds_info_copy(iter, buffer, item_len);
  539. len -= item_len;
  540. }
  541. lens->nr++;
  542. }
  543. }
  544. rcu_read_unlock();
  545. }
  546. static int rds_conn_info_visitor(struct rds_conn_path *cp, void *buffer)
  547. {
  548. struct rds_info_connection *cinfo = buffer;
  549. cinfo->next_tx_seq = cp->cp_next_tx_seq;
  550. cinfo->next_rx_seq = cp->cp_next_rx_seq;
  551. cinfo->laddr = cp->cp_conn->c_laddr;
  552. cinfo->faddr = cp->cp_conn->c_faddr;
  553. strncpy(cinfo->transport, cp->cp_conn->c_trans->t_name,
  554. sizeof(cinfo->transport));
  555. cinfo->flags = 0;
  556. rds_conn_info_set(cinfo->flags, test_bit(RDS_IN_XMIT, &cp->cp_flags),
  557. SENDING);
  558. /* XXX Future: return the state rather than these funky bits */
  559. rds_conn_info_set(cinfo->flags,
  560. atomic_read(&cp->cp_state) == RDS_CONN_CONNECTING,
  561. CONNECTING);
  562. rds_conn_info_set(cinfo->flags,
  563. atomic_read(&cp->cp_state) == RDS_CONN_UP,
  564. CONNECTED);
  565. return 1;
  566. }
  567. static void rds_conn_info(struct socket *sock, unsigned int len,
  568. struct rds_info_iterator *iter,
  569. struct rds_info_lengths *lens)
  570. {
  571. u64 buffer[(sizeof(struct rds_info_connection) + 7) / 8];
  572. rds_walk_conn_path_info(sock, len, iter, lens,
  573. rds_conn_info_visitor,
  574. buffer,
  575. sizeof(struct rds_info_connection));
  576. }
  577. int rds_conn_init(void)
  578. {
  579. rds_conn_slab = kmem_cache_create("rds_connection",
  580. sizeof(struct rds_connection),
  581. 0, 0, NULL);
  582. if (!rds_conn_slab)
  583. return -ENOMEM;
  584. rds_info_register_func(RDS_INFO_CONNECTIONS, rds_conn_info);
  585. rds_info_register_func(RDS_INFO_SEND_MESSAGES,
  586. rds_conn_message_info_send);
  587. rds_info_register_func(RDS_INFO_RETRANS_MESSAGES,
  588. rds_conn_message_info_retrans);
  589. return 0;
  590. }
  591. void rds_conn_exit(void)
  592. {
  593. rds_loop_exit();
  594. WARN_ON(!hlist_empty(rds_conn_hash));
  595. kmem_cache_destroy(rds_conn_slab);
  596. rds_info_deregister_func(RDS_INFO_CONNECTIONS, rds_conn_info);
  597. rds_info_deregister_func(RDS_INFO_SEND_MESSAGES,
  598. rds_conn_message_info_send);
  599. rds_info_deregister_func(RDS_INFO_RETRANS_MESSAGES,
  600. rds_conn_message_info_retrans);
  601. }
  602. /*
  603. * Force a disconnect
  604. */
  605. void rds_conn_path_drop(struct rds_conn_path *cp, bool destroy)
  606. {
  607. atomic_set(&cp->cp_state, RDS_CONN_ERROR);
  608. rcu_read_lock();
  609. if (!destroy && rds_destroy_pending(cp->cp_conn)) {
  610. rcu_read_unlock();
  611. return;
  612. }
  613. queue_work(rds_wq, &cp->cp_down_w);
  614. rcu_read_unlock();
  615. }
  616. EXPORT_SYMBOL_GPL(rds_conn_path_drop);
  617. void rds_conn_drop(struct rds_connection *conn)
  618. {
  619. WARN_ON(conn->c_trans->t_mp_capable);
  620. rds_conn_path_drop(&conn->c_path[0], false);
  621. }
  622. EXPORT_SYMBOL_GPL(rds_conn_drop);
  623. /*
  624. * If the connection is down, trigger a connect. We may have scheduled a
  625. * delayed reconnect however - in this case we should not interfere.
  626. */
  627. void rds_conn_path_connect_if_down(struct rds_conn_path *cp)
  628. {
  629. rcu_read_lock();
  630. if (rds_destroy_pending(cp->cp_conn)) {
  631. rcu_read_unlock();
  632. return;
  633. }
  634. if (rds_conn_path_state(cp) == RDS_CONN_DOWN &&
  635. !test_and_set_bit(RDS_RECONNECT_PENDING, &cp->cp_flags))
  636. queue_delayed_work(rds_wq, &cp->cp_conn_w, 0);
  637. rcu_read_unlock();
  638. }
  639. EXPORT_SYMBOL_GPL(rds_conn_path_connect_if_down);
  640. void rds_conn_connect_if_down(struct rds_connection *conn)
  641. {
  642. WARN_ON(conn->c_trans->t_mp_capable);
  643. rds_conn_path_connect_if_down(&conn->c_path[0]);
  644. }
  645. EXPORT_SYMBOL_GPL(rds_conn_connect_if_down);
  646. void
  647. __rds_conn_path_error(struct rds_conn_path *cp, const char *fmt, ...)
  648. {
  649. va_list ap;
  650. va_start(ap, fmt);
  651. vprintk(fmt, ap);
  652. va_end(ap);
  653. rds_conn_path_drop(cp, false);
  654. }