send.c 34 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297
  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/moduleparam.h>
  35. #include <linux/gfp.h>
  36. #include <net/sock.h>
  37. #include <linux/in.h>
  38. #include <linux/list.h>
  39. #include <linux/ratelimit.h>
  40. #include <linux/export.h>
  41. #include <linux/sizes.h>
  42. #include "rds.h"
  43. /* When transmitting messages in rds_send_xmit, we need to emerge from
  44. * time to time and briefly release the CPU. Otherwise the softlock watchdog
  45. * will kick our shin.
  46. * Also, it seems fairer to not let one busy connection stall all the
  47. * others.
  48. *
  49. * send_batch_count is the number of times we'll loop in send_xmit. Setting
  50. * it to 0 will restore the old behavior (where we looped until we had
  51. * drained the queue).
  52. */
  53. static int send_batch_count = SZ_1K;
  54. module_param(send_batch_count, int, 0444);
  55. MODULE_PARM_DESC(send_batch_count, " batch factor when working the send queue");
  56. static void rds_send_remove_from_sock(struct list_head *messages, int status);
  57. /*
  58. * Reset the send state. Callers must ensure that this doesn't race with
  59. * rds_send_xmit().
  60. */
  61. void rds_send_path_reset(struct rds_conn_path *cp)
  62. {
  63. struct rds_message *rm, *tmp;
  64. unsigned long flags;
  65. if (cp->cp_xmit_rm) {
  66. rm = cp->cp_xmit_rm;
  67. cp->cp_xmit_rm = NULL;
  68. /* Tell the user the RDMA op is no longer mapped by the
  69. * transport. This isn't entirely true (it's flushed out
  70. * independently) but as the connection is down, there's
  71. * no ongoing RDMA to/from that memory */
  72. rds_message_unmapped(rm);
  73. rds_message_put(rm);
  74. }
  75. cp->cp_xmit_sg = 0;
  76. cp->cp_xmit_hdr_off = 0;
  77. cp->cp_xmit_data_off = 0;
  78. cp->cp_xmit_atomic_sent = 0;
  79. cp->cp_xmit_rdma_sent = 0;
  80. cp->cp_xmit_data_sent = 0;
  81. cp->cp_conn->c_map_queued = 0;
  82. cp->cp_unacked_packets = rds_sysctl_max_unacked_packets;
  83. cp->cp_unacked_bytes = rds_sysctl_max_unacked_bytes;
  84. /* Mark messages as retransmissions, and move them to the send q */
  85. spin_lock_irqsave(&cp->cp_lock, flags);
  86. list_for_each_entry_safe(rm, tmp, &cp->cp_retrans, m_conn_item) {
  87. set_bit(RDS_MSG_ACK_REQUIRED, &rm->m_flags);
  88. set_bit(RDS_MSG_RETRANSMITTED, &rm->m_flags);
  89. }
  90. list_splice_init(&cp->cp_retrans, &cp->cp_send_queue);
  91. spin_unlock_irqrestore(&cp->cp_lock, flags);
  92. }
  93. EXPORT_SYMBOL_GPL(rds_send_path_reset);
  94. static int acquire_in_xmit(struct rds_conn_path *cp)
  95. {
  96. return test_and_set_bit(RDS_IN_XMIT, &cp->cp_flags) == 0;
  97. }
  98. static void release_in_xmit(struct rds_conn_path *cp)
  99. {
  100. clear_bit(RDS_IN_XMIT, &cp->cp_flags);
  101. smp_mb__after_atomic();
  102. /*
  103. * We don't use wait_on_bit()/wake_up_bit() because our waking is in a
  104. * hot path and finding waiters is very rare. We don't want to walk
  105. * the system-wide hashed waitqueue buckets in the fast path only to
  106. * almost never find waiters.
  107. */
  108. if (waitqueue_active(&cp->cp_waitq))
  109. wake_up_all(&cp->cp_waitq);
  110. }
  111. /*
  112. * We're making the conscious trade-off here to only send one message
  113. * down the connection at a time.
  114. * Pro:
  115. * - tx queueing is a simple fifo list
  116. * - reassembly is optional and easily done by transports per conn
  117. * - no per flow rx lookup at all, straight to the socket
  118. * - less per-frag memory and wire overhead
  119. * Con:
  120. * - queued acks can be delayed behind large messages
  121. * Depends:
  122. * - small message latency is higher behind queued large messages
  123. * - large message latency isn't starved by intervening small sends
  124. */
  125. int rds_send_xmit(struct rds_conn_path *cp)
  126. {
  127. struct rds_connection *conn = cp->cp_conn;
  128. struct rds_message *rm;
  129. unsigned long flags;
  130. unsigned int tmp;
  131. struct scatterlist *sg;
  132. int ret = 0;
  133. LIST_HEAD(to_be_dropped);
  134. int batch_count;
  135. unsigned long send_gen = 0;
  136. restart:
  137. batch_count = 0;
  138. /*
  139. * sendmsg calls here after having queued its message on the send
  140. * queue. We only have one task feeding the connection at a time. If
  141. * another thread is already feeding the queue then we back off. This
  142. * avoids blocking the caller and trading per-connection data between
  143. * caches per message.
  144. */
  145. if (!acquire_in_xmit(cp)) {
  146. rds_stats_inc(s_send_lock_contention);
  147. ret = -ENOMEM;
  148. goto out;
  149. }
  150. /*
  151. * we record the send generation after doing the xmit acquire.
  152. * if someone else manages to jump in and do some work, we'll use
  153. * this to avoid a goto restart farther down.
  154. *
  155. * The acquire_in_xmit() check above ensures that only one
  156. * caller can increment c_send_gen at any time.
  157. */
  158. cp->cp_send_gen++;
  159. send_gen = cp->cp_send_gen;
  160. /*
  161. * rds_conn_shutdown() sets the conn state and then tests RDS_IN_XMIT,
  162. * we do the opposite to avoid races.
  163. */
  164. if (!rds_conn_path_up(cp)) {
  165. release_in_xmit(cp);
  166. ret = 0;
  167. goto out;
  168. }
  169. if (conn->c_trans->xmit_path_prepare)
  170. conn->c_trans->xmit_path_prepare(cp);
  171. /*
  172. * spin trying to push headers and data down the connection until
  173. * the connection doesn't make forward progress.
  174. */
  175. while (1) {
  176. rm = cp->cp_xmit_rm;
  177. /*
  178. * If between sending messages, we can send a pending congestion
  179. * map update.
  180. */
  181. if (!rm && test_and_clear_bit(0, &conn->c_map_queued)) {
  182. rm = rds_cong_update_alloc(conn);
  183. if (IS_ERR(rm)) {
  184. ret = PTR_ERR(rm);
  185. break;
  186. }
  187. rm->data.op_active = 1;
  188. rm->m_inc.i_conn_path = cp;
  189. rm->m_inc.i_conn = cp->cp_conn;
  190. cp->cp_xmit_rm = rm;
  191. }
  192. /*
  193. * If not already working on one, grab the next message.
  194. *
  195. * cp_xmit_rm holds a ref while we're sending this message down
  196. * the connction. We can use this ref while holding the
  197. * send_sem.. rds_send_reset() is serialized with it.
  198. */
  199. if (!rm) {
  200. unsigned int len;
  201. batch_count++;
  202. /* we want to process as big a batch as we can, but
  203. * we also want to avoid softlockups. If we've been
  204. * through a lot of messages, lets back off and see
  205. * if anyone else jumps in
  206. */
  207. if (batch_count >= send_batch_count)
  208. goto over_batch;
  209. spin_lock_irqsave(&cp->cp_lock, flags);
  210. if (!list_empty(&cp->cp_send_queue)) {
  211. rm = list_entry(cp->cp_send_queue.next,
  212. struct rds_message,
  213. m_conn_item);
  214. rds_message_addref(rm);
  215. /*
  216. * Move the message from the send queue to the retransmit
  217. * list right away.
  218. */
  219. list_move_tail(&rm->m_conn_item,
  220. &cp->cp_retrans);
  221. }
  222. spin_unlock_irqrestore(&cp->cp_lock, flags);
  223. if (!rm)
  224. break;
  225. /* Unfortunately, the way Infiniband deals with
  226. * RDMA to a bad MR key is by moving the entire
  227. * queue pair to error state. We cold possibly
  228. * recover from that, but right now we drop the
  229. * connection.
  230. * Therefore, we never retransmit messages with RDMA ops.
  231. */
  232. if (test_bit(RDS_MSG_FLUSH, &rm->m_flags) ||
  233. (rm->rdma.op_active &&
  234. test_bit(RDS_MSG_RETRANSMITTED, &rm->m_flags))) {
  235. spin_lock_irqsave(&cp->cp_lock, flags);
  236. if (test_and_clear_bit(RDS_MSG_ON_CONN, &rm->m_flags))
  237. list_move(&rm->m_conn_item, &to_be_dropped);
  238. spin_unlock_irqrestore(&cp->cp_lock, flags);
  239. continue;
  240. }
  241. /* Require an ACK every once in a while */
  242. len = ntohl(rm->m_inc.i_hdr.h_len);
  243. if (cp->cp_unacked_packets == 0 ||
  244. cp->cp_unacked_bytes < len) {
  245. __set_bit(RDS_MSG_ACK_REQUIRED, &rm->m_flags);
  246. cp->cp_unacked_packets =
  247. rds_sysctl_max_unacked_packets;
  248. cp->cp_unacked_bytes =
  249. rds_sysctl_max_unacked_bytes;
  250. rds_stats_inc(s_send_ack_required);
  251. } else {
  252. cp->cp_unacked_bytes -= len;
  253. cp->cp_unacked_packets--;
  254. }
  255. cp->cp_xmit_rm = rm;
  256. }
  257. /* The transport either sends the whole rdma or none of it */
  258. if (rm->rdma.op_active && !cp->cp_xmit_rdma_sent) {
  259. rm->m_final_op = &rm->rdma;
  260. /* The transport owns the mapped memory for now.
  261. * You can't unmap it while it's on the send queue
  262. */
  263. set_bit(RDS_MSG_MAPPED, &rm->m_flags);
  264. ret = conn->c_trans->xmit_rdma(conn, &rm->rdma);
  265. if (ret) {
  266. clear_bit(RDS_MSG_MAPPED, &rm->m_flags);
  267. wake_up_interruptible(&rm->m_flush_wait);
  268. break;
  269. }
  270. cp->cp_xmit_rdma_sent = 1;
  271. }
  272. if (rm->atomic.op_active && !cp->cp_xmit_atomic_sent) {
  273. rm->m_final_op = &rm->atomic;
  274. /* The transport owns the mapped memory for now.
  275. * You can't unmap it while it's on the send queue
  276. */
  277. set_bit(RDS_MSG_MAPPED, &rm->m_flags);
  278. ret = conn->c_trans->xmit_atomic(conn, &rm->atomic);
  279. if (ret) {
  280. clear_bit(RDS_MSG_MAPPED, &rm->m_flags);
  281. wake_up_interruptible(&rm->m_flush_wait);
  282. break;
  283. }
  284. cp->cp_xmit_atomic_sent = 1;
  285. }
  286. /*
  287. * A number of cases require an RDS header to be sent
  288. * even if there is no data.
  289. * We permit 0-byte sends; rds-ping depends on this.
  290. * However, if there are exclusively attached silent ops,
  291. * we skip the hdr/data send, to enable silent operation.
  292. */
  293. if (rm->data.op_nents == 0) {
  294. int ops_present;
  295. int all_ops_are_silent = 1;
  296. ops_present = (rm->atomic.op_active || rm->rdma.op_active);
  297. if (rm->atomic.op_active && !rm->atomic.op_silent)
  298. all_ops_are_silent = 0;
  299. if (rm->rdma.op_active && !rm->rdma.op_silent)
  300. all_ops_are_silent = 0;
  301. if (ops_present && all_ops_are_silent
  302. && !rm->m_rdma_cookie)
  303. rm->data.op_active = 0;
  304. }
  305. if (rm->data.op_active && !cp->cp_xmit_data_sent) {
  306. rm->m_final_op = &rm->data;
  307. ret = conn->c_trans->xmit(conn, rm,
  308. cp->cp_xmit_hdr_off,
  309. cp->cp_xmit_sg,
  310. cp->cp_xmit_data_off);
  311. if (ret <= 0)
  312. break;
  313. if (cp->cp_xmit_hdr_off < sizeof(struct rds_header)) {
  314. tmp = min_t(int, ret,
  315. sizeof(struct rds_header) -
  316. cp->cp_xmit_hdr_off);
  317. cp->cp_xmit_hdr_off += tmp;
  318. ret -= tmp;
  319. }
  320. sg = &rm->data.op_sg[cp->cp_xmit_sg];
  321. while (ret) {
  322. tmp = min_t(int, ret, sg->length -
  323. cp->cp_xmit_data_off);
  324. cp->cp_xmit_data_off += tmp;
  325. ret -= tmp;
  326. if (cp->cp_xmit_data_off == sg->length) {
  327. cp->cp_xmit_data_off = 0;
  328. sg++;
  329. cp->cp_xmit_sg++;
  330. BUG_ON(ret != 0 && cp->cp_xmit_sg ==
  331. rm->data.op_nents);
  332. }
  333. }
  334. if (cp->cp_xmit_hdr_off == sizeof(struct rds_header) &&
  335. (cp->cp_xmit_sg == rm->data.op_nents))
  336. cp->cp_xmit_data_sent = 1;
  337. }
  338. /*
  339. * A rm will only take multiple times through this loop
  340. * if there is a data op. Thus, if the data is sent (or there was
  341. * none), then we're done with the rm.
  342. */
  343. if (!rm->data.op_active || cp->cp_xmit_data_sent) {
  344. cp->cp_xmit_rm = NULL;
  345. cp->cp_xmit_sg = 0;
  346. cp->cp_xmit_hdr_off = 0;
  347. cp->cp_xmit_data_off = 0;
  348. cp->cp_xmit_rdma_sent = 0;
  349. cp->cp_xmit_atomic_sent = 0;
  350. cp->cp_xmit_data_sent = 0;
  351. rds_message_put(rm);
  352. }
  353. }
  354. over_batch:
  355. if (conn->c_trans->xmit_path_complete)
  356. conn->c_trans->xmit_path_complete(cp);
  357. release_in_xmit(cp);
  358. /* Nuke any messages we decided not to retransmit. */
  359. if (!list_empty(&to_be_dropped)) {
  360. /* irqs on here, so we can put(), unlike above */
  361. list_for_each_entry(rm, &to_be_dropped, m_conn_item)
  362. rds_message_put(rm);
  363. rds_send_remove_from_sock(&to_be_dropped, RDS_RDMA_DROPPED);
  364. }
  365. /*
  366. * Other senders can queue a message after we last test the send queue
  367. * but before we clear RDS_IN_XMIT. In that case they'd back off and
  368. * not try and send their newly queued message. We need to check the
  369. * send queue after having cleared RDS_IN_XMIT so that their message
  370. * doesn't get stuck on the send queue.
  371. *
  372. * If the transport cannot continue (i.e ret != 0), then it must
  373. * call us when more room is available, such as from the tx
  374. * completion handler.
  375. *
  376. * We have an extra generation check here so that if someone manages
  377. * to jump in after our release_in_xmit, we'll see that they have done
  378. * some work and we will skip our goto
  379. */
  380. if (ret == 0) {
  381. smp_mb();
  382. if ((test_bit(0, &conn->c_map_queued) ||
  383. !list_empty(&cp->cp_send_queue)) &&
  384. send_gen == cp->cp_send_gen) {
  385. rds_stats_inc(s_send_lock_queue_raced);
  386. if (batch_count < send_batch_count)
  387. goto restart;
  388. queue_delayed_work(rds_wq, &cp->cp_send_w, 1);
  389. }
  390. }
  391. out:
  392. return ret;
  393. }
  394. EXPORT_SYMBOL_GPL(rds_send_xmit);
  395. static void rds_send_sndbuf_remove(struct rds_sock *rs, struct rds_message *rm)
  396. {
  397. u32 len = be32_to_cpu(rm->m_inc.i_hdr.h_len);
  398. assert_spin_locked(&rs->rs_lock);
  399. BUG_ON(rs->rs_snd_bytes < len);
  400. rs->rs_snd_bytes -= len;
  401. if (rs->rs_snd_bytes == 0)
  402. rds_stats_inc(s_send_queue_empty);
  403. }
  404. static inline int rds_send_is_acked(struct rds_message *rm, u64 ack,
  405. is_acked_func is_acked)
  406. {
  407. if (is_acked)
  408. return is_acked(rm, ack);
  409. return be64_to_cpu(rm->m_inc.i_hdr.h_sequence) <= ack;
  410. }
  411. /*
  412. * This is pretty similar to what happens below in the ACK
  413. * handling code - except that we call here as soon as we get
  414. * the IB send completion on the RDMA op and the accompanying
  415. * message.
  416. */
  417. void rds_rdma_send_complete(struct rds_message *rm, int status)
  418. {
  419. struct rds_sock *rs = NULL;
  420. struct rm_rdma_op *ro;
  421. struct rds_notifier *notifier;
  422. unsigned long flags;
  423. unsigned int notify = 0;
  424. spin_lock_irqsave(&rm->m_rs_lock, flags);
  425. notify = rm->rdma.op_notify | rm->data.op_notify;
  426. ro = &rm->rdma;
  427. if (test_bit(RDS_MSG_ON_SOCK, &rm->m_flags) &&
  428. ro->op_active && notify && ro->op_notifier) {
  429. notifier = ro->op_notifier;
  430. rs = rm->m_rs;
  431. sock_hold(rds_rs_to_sk(rs));
  432. notifier->n_status = status;
  433. spin_lock(&rs->rs_lock);
  434. list_add_tail(&notifier->n_list, &rs->rs_notify_queue);
  435. spin_unlock(&rs->rs_lock);
  436. ro->op_notifier = NULL;
  437. }
  438. spin_unlock_irqrestore(&rm->m_rs_lock, flags);
  439. if (rs) {
  440. rds_wake_sk_sleep(rs);
  441. sock_put(rds_rs_to_sk(rs));
  442. }
  443. }
  444. EXPORT_SYMBOL_GPL(rds_rdma_send_complete);
  445. /*
  446. * Just like above, except looks at atomic op
  447. */
  448. void rds_atomic_send_complete(struct rds_message *rm, int status)
  449. {
  450. struct rds_sock *rs = NULL;
  451. struct rm_atomic_op *ao;
  452. struct rds_notifier *notifier;
  453. unsigned long flags;
  454. spin_lock_irqsave(&rm->m_rs_lock, flags);
  455. ao = &rm->atomic;
  456. if (test_bit(RDS_MSG_ON_SOCK, &rm->m_flags)
  457. && ao->op_active && ao->op_notify && ao->op_notifier) {
  458. notifier = ao->op_notifier;
  459. rs = rm->m_rs;
  460. sock_hold(rds_rs_to_sk(rs));
  461. notifier->n_status = status;
  462. spin_lock(&rs->rs_lock);
  463. list_add_tail(&notifier->n_list, &rs->rs_notify_queue);
  464. spin_unlock(&rs->rs_lock);
  465. ao->op_notifier = NULL;
  466. }
  467. spin_unlock_irqrestore(&rm->m_rs_lock, flags);
  468. if (rs) {
  469. rds_wake_sk_sleep(rs);
  470. sock_put(rds_rs_to_sk(rs));
  471. }
  472. }
  473. EXPORT_SYMBOL_GPL(rds_atomic_send_complete);
  474. /*
  475. * This is the same as rds_rdma_send_complete except we
  476. * don't do any locking - we have all the ingredients (message,
  477. * socket, socket lock) and can just move the notifier.
  478. */
  479. static inline void
  480. __rds_send_complete(struct rds_sock *rs, struct rds_message *rm, int status)
  481. {
  482. struct rm_rdma_op *ro;
  483. struct rm_atomic_op *ao;
  484. ro = &rm->rdma;
  485. if (ro->op_active && ro->op_notify && ro->op_notifier) {
  486. ro->op_notifier->n_status = status;
  487. list_add_tail(&ro->op_notifier->n_list, &rs->rs_notify_queue);
  488. ro->op_notifier = NULL;
  489. }
  490. ao = &rm->atomic;
  491. if (ao->op_active && ao->op_notify && ao->op_notifier) {
  492. ao->op_notifier->n_status = status;
  493. list_add_tail(&ao->op_notifier->n_list, &rs->rs_notify_queue);
  494. ao->op_notifier = NULL;
  495. }
  496. /* No need to wake the app - caller does this */
  497. }
  498. /*
  499. * This removes messages from the socket's list if they're on it. The list
  500. * argument must be private to the caller, we must be able to modify it
  501. * without locks. The messages must have a reference held for their
  502. * position on the list. This function will drop that reference after
  503. * removing the messages from the 'messages' list regardless of if it found
  504. * the messages on the socket list or not.
  505. */
  506. static void rds_send_remove_from_sock(struct list_head *messages, int status)
  507. {
  508. unsigned long flags;
  509. struct rds_sock *rs = NULL;
  510. struct rds_message *rm;
  511. while (!list_empty(messages)) {
  512. int was_on_sock = 0;
  513. rm = list_entry(messages->next, struct rds_message,
  514. m_conn_item);
  515. list_del_init(&rm->m_conn_item);
  516. /*
  517. * If we see this flag cleared then we're *sure* that someone
  518. * else beat us to removing it from the sock. If we race
  519. * with their flag update we'll get the lock and then really
  520. * see that the flag has been cleared.
  521. *
  522. * The message spinlock makes sure nobody clears rm->m_rs
  523. * while we're messing with it. It does not prevent the
  524. * message from being removed from the socket, though.
  525. */
  526. spin_lock_irqsave(&rm->m_rs_lock, flags);
  527. if (!test_bit(RDS_MSG_ON_SOCK, &rm->m_flags))
  528. goto unlock_and_drop;
  529. if (rs != rm->m_rs) {
  530. if (rs) {
  531. rds_wake_sk_sleep(rs);
  532. sock_put(rds_rs_to_sk(rs));
  533. }
  534. rs = rm->m_rs;
  535. if (rs)
  536. sock_hold(rds_rs_to_sk(rs));
  537. }
  538. if (!rs)
  539. goto unlock_and_drop;
  540. spin_lock(&rs->rs_lock);
  541. if (test_and_clear_bit(RDS_MSG_ON_SOCK, &rm->m_flags)) {
  542. struct rm_rdma_op *ro = &rm->rdma;
  543. struct rds_notifier *notifier;
  544. list_del_init(&rm->m_sock_item);
  545. rds_send_sndbuf_remove(rs, rm);
  546. if (ro->op_active && ro->op_notifier &&
  547. (ro->op_notify || (ro->op_recverr && status))) {
  548. notifier = ro->op_notifier;
  549. list_add_tail(&notifier->n_list,
  550. &rs->rs_notify_queue);
  551. if (!notifier->n_status)
  552. notifier->n_status = status;
  553. rm->rdma.op_notifier = NULL;
  554. }
  555. was_on_sock = 1;
  556. rm->m_rs = NULL;
  557. }
  558. spin_unlock(&rs->rs_lock);
  559. unlock_and_drop:
  560. spin_unlock_irqrestore(&rm->m_rs_lock, flags);
  561. rds_message_put(rm);
  562. if (was_on_sock)
  563. rds_message_put(rm);
  564. }
  565. if (rs) {
  566. rds_wake_sk_sleep(rs);
  567. sock_put(rds_rs_to_sk(rs));
  568. }
  569. }
  570. /*
  571. * Transports call here when they've determined that the receiver queued
  572. * messages up to, and including, the given sequence number. Messages are
  573. * moved to the retrans queue when rds_send_xmit picks them off the send
  574. * queue. This means that in the TCP case, the message may not have been
  575. * assigned the m_ack_seq yet - but that's fine as long as tcp_is_acked
  576. * checks the RDS_MSG_HAS_ACK_SEQ bit.
  577. */
  578. void rds_send_path_drop_acked(struct rds_conn_path *cp, u64 ack,
  579. is_acked_func is_acked)
  580. {
  581. struct rds_message *rm, *tmp;
  582. unsigned long flags;
  583. LIST_HEAD(list);
  584. spin_lock_irqsave(&cp->cp_lock, flags);
  585. list_for_each_entry_safe(rm, tmp, &cp->cp_retrans, m_conn_item) {
  586. if (!rds_send_is_acked(rm, ack, is_acked))
  587. break;
  588. list_move(&rm->m_conn_item, &list);
  589. clear_bit(RDS_MSG_ON_CONN, &rm->m_flags);
  590. }
  591. /* order flag updates with spin locks */
  592. if (!list_empty(&list))
  593. smp_mb__after_atomic();
  594. spin_unlock_irqrestore(&cp->cp_lock, flags);
  595. /* now remove the messages from the sock list as needed */
  596. rds_send_remove_from_sock(&list, RDS_RDMA_SUCCESS);
  597. }
  598. EXPORT_SYMBOL_GPL(rds_send_path_drop_acked);
  599. void rds_send_drop_acked(struct rds_connection *conn, u64 ack,
  600. is_acked_func is_acked)
  601. {
  602. WARN_ON(conn->c_trans->t_mp_capable);
  603. rds_send_path_drop_acked(&conn->c_path[0], ack, is_acked);
  604. }
  605. EXPORT_SYMBOL_GPL(rds_send_drop_acked);
  606. void rds_send_drop_to(struct rds_sock *rs, struct sockaddr_in *dest)
  607. {
  608. struct rds_message *rm, *tmp;
  609. struct rds_connection *conn;
  610. struct rds_conn_path *cp;
  611. unsigned long flags;
  612. LIST_HEAD(list);
  613. /* get all the messages we're dropping under the rs lock */
  614. spin_lock_irqsave(&rs->rs_lock, flags);
  615. list_for_each_entry_safe(rm, tmp, &rs->rs_send_queue, m_sock_item) {
  616. if (dest && (dest->sin_addr.s_addr != rm->m_daddr ||
  617. dest->sin_port != rm->m_inc.i_hdr.h_dport))
  618. continue;
  619. list_move(&rm->m_sock_item, &list);
  620. rds_send_sndbuf_remove(rs, rm);
  621. clear_bit(RDS_MSG_ON_SOCK, &rm->m_flags);
  622. }
  623. /* order flag updates with the rs lock */
  624. smp_mb__after_atomic();
  625. spin_unlock_irqrestore(&rs->rs_lock, flags);
  626. if (list_empty(&list))
  627. return;
  628. /* Remove the messages from the conn */
  629. list_for_each_entry(rm, &list, m_sock_item) {
  630. conn = rm->m_inc.i_conn;
  631. if (conn->c_trans->t_mp_capable)
  632. cp = rm->m_inc.i_conn_path;
  633. else
  634. cp = &conn->c_path[0];
  635. spin_lock_irqsave(&cp->cp_lock, flags);
  636. /*
  637. * Maybe someone else beat us to removing rm from the conn.
  638. * If we race with their flag update we'll get the lock and
  639. * then really see that the flag has been cleared.
  640. */
  641. if (!test_and_clear_bit(RDS_MSG_ON_CONN, &rm->m_flags)) {
  642. spin_unlock_irqrestore(&cp->cp_lock, flags);
  643. spin_lock_irqsave(&rm->m_rs_lock, flags);
  644. rm->m_rs = NULL;
  645. spin_unlock_irqrestore(&rm->m_rs_lock, flags);
  646. continue;
  647. }
  648. list_del_init(&rm->m_conn_item);
  649. spin_unlock_irqrestore(&cp->cp_lock, flags);
  650. /*
  651. * Couldn't grab m_rs_lock in top loop (lock ordering),
  652. * but we can now.
  653. */
  654. spin_lock_irqsave(&rm->m_rs_lock, flags);
  655. spin_lock(&rs->rs_lock);
  656. __rds_send_complete(rs, rm, RDS_RDMA_CANCELED);
  657. spin_unlock(&rs->rs_lock);
  658. rm->m_rs = NULL;
  659. spin_unlock_irqrestore(&rm->m_rs_lock, flags);
  660. rds_message_put(rm);
  661. }
  662. rds_wake_sk_sleep(rs);
  663. while (!list_empty(&list)) {
  664. rm = list_entry(list.next, struct rds_message, m_sock_item);
  665. list_del_init(&rm->m_sock_item);
  666. rds_message_wait(rm);
  667. /* just in case the code above skipped this message
  668. * because RDS_MSG_ON_CONN wasn't set, run it again here
  669. * taking m_rs_lock is the only thing that keeps us
  670. * from racing with ack processing.
  671. */
  672. spin_lock_irqsave(&rm->m_rs_lock, flags);
  673. spin_lock(&rs->rs_lock);
  674. __rds_send_complete(rs, rm, RDS_RDMA_CANCELED);
  675. spin_unlock(&rs->rs_lock);
  676. rm->m_rs = NULL;
  677. spin_unlock_irqrestore(&rm->m_rs_lock, flags);
  678. rds_message_put(rm);
  679. }
  680. }
  681. /*
  682. * we only want this to fire once so we use the callers 'queued'. It's
  683. * possible that another thread can race with us and remove the
  684. * message from the flow with RDS_CANCEL_SENT_TO.
  685. */
  686. static int rds_send_queue_rm(struct rds_sock *rs, struct rds_connection *conn,
  687. struct rds_conn_path *cp,
  688. struct rds_message *rm, __be16 sport,
  689. __be16 dport, int *queued)
  690. {
  691. unsigned long flags;
  692. u32 len;
  693. if (*queued)
  694. goto out;
  695. len = be32_to_cpu(rm->m_inc.i_hdr.h_len);
  696. /* this is the only place which holds both the socket's rs_lock
  697. * and the connection's c_lock */
  698. spin_lock_irqsave(&rs->rs_lock, flags);
  699. /*
  700. * If there is a little space in sndbuf, we don't queue anything,
  701. * and userspace gets -EAGAIN. But poll() indicates there's send
  702. * room. This can lead to bad behavior (spinning) if snd_bytes isn't
  703. * freed up by incoming acks. So we check the *old* value of
  704. * rs_snd_bytes here to allow the last msg to exceed the buffer,
  705. * and poll() now knows no more data can be sent.
  706. */
  707. if (rs->rs_snd_bytes < rds_sk_sndbuf(rs)) {
  708. rs->rs_snd_bytes += len;
  709. /* let recv side know we are close to send space exhaustion.
  710. * This is probably not the optimal way to do it, as this
  711. * means we set the flag on *all* messages as soon as our
  712. * throughput hits a certain threshold.
  713. */
  714. if (rs->rs_snd_bytes >= rds_sk_sndbuf(rs) / 2)
  715. __set_bit(RDS_MSG_ACK_REQUIRED, &rm->m_flags);
  716. list_add_tail(&rm->m_sock_item, &rs->rs_send_queue);
  717. set_bit(RDS_MSG_ON_SOCK, &rm->m_flags);
  718. rds_message_addref(rm);
  719. rm->m_rs = rs;
  720. /* The code ordering is a little weird, but we're
  721. trying to minimize the time we hold c_lock */
  722. rds_message_populate_header(&rm->m_inc.i_hdr, sport, dport, 0);
  723. rm->m_inc.i_conn = conn;
  724. rm->m_inc.i_conn_path = cp;
  725. rds_message_addref(rm);
  726. spin_lock(&cp->cp_lock);
  727. rm->m_inc.i_hdr.h_sequence = cpu_to_be64(cp->cp_next_tx_seq++);
  728. list_add_tail(&rm->m_conn_item, &cp->cp_send_queue);
  729. set_bit(RDS_MSG_ON_CONN, &rm->m_flags);
  730. spin_unlock(&cp->cp_lock);
  731. rdsdebug("queued msg %p len %d, rs %p bytes %d seq %llu\n",
  732. rm, len, rs, rs->rs_snd_bytes,
  733. (unsigned long long)be64_to_cpu(rm->m_inc.i_hdr.h_sequence));
  734. *queued = 1;
  735. }
  736. spin_unlock_irqrestore(&rs->rs_lock, flags);
  737. out:
  738. return *queued;
  739. }
  740. /*
  741. * rds_message is getting to be quite complicated, and we'd like to allocate
  742. * it all in one go. This figures out how big it needs to be up front.
  743. */
  744. static int rds_rm_size(struct msghdr *msg, int data_len)
  745. {
  746. struct cmsghdr *cmsg;
  747. int size = 0;
  748. int cmsg_groups = 0;
  749. int retval;
  750. for_each_cmsghdr(cmsg, msg) {
  751. if (!CMSG_OK(msg, cmsg))
  752. return -EINVAL;
  753. if (cmsg->cmsg_level != SOL_RDS)
  754. continue;
  755. switch (cmsg->cmsg_type) {
  756. case RDS_CMSG_RDMA_ARGS:
  757. cmsg_groups |= 1;
  758. retval = rds_rdma_extra_size(CMSG_DATA(cmsg));
  759. if (retval < 0)
  760. return retval;
  761. size += retval;
  762. break;
  763. case RDS_CMSG_RDMA_DEST:
  764. case RDS_CMSG_RDMA_MAP:
  765. cmsg_groups |= 2;
  766. /* these are valid but do no add any size */
  767. break;
  768. case RDS_CMSG_ATOMIC_CSWP:
  769. case RDS_CMSG_ATOMIC_FADD:
  770. case RDS_CMSG_MASKED_ATOMIC_CSWP:
  771. case RDS_CMSG_MASKED_ATOMIC_FADD:
  772. cmsg_groups |= 1;
  773. size += sizeof(struct scatterlist);
  774. break;
  775. default:
  776. return -EINVAL;
  777. }
  778. }
  779. size += ceil(data_len, PAGE_SIZE) * sizeof(struct scatterlist);
  780. /* Ensure (DEST, MAP) are never used with (ARGS, ATOMIC) */
  781. if (cmsg_groups == 3)
  782. return -EINVAL;
  783. return size;
  784. }
  785. static int rds_cmsg_send(struct rds_sock *rs, struct rds_message *rm,
  786. struct msghdr *msg, int *allocated_mr)
  787. {
  788. struct cmsghdr *cmsg;
  789. int ret = 0;
  790. for_each_cmsghdr(cmsg, msg) {
  791. if (!CMSG_OK(msg, cmsg))
  792. return -EINVAL;
  793. if (cmsg->cmsg_level != SOL_RDS)
  794. continue;
  795. /* As a side effect, RDMA_DEST and RDMA_MAP will set
  796. * rm->rdma.m_rdma_cookie and rm->rdma.m_rdma_mr.
  797. */
  798. switch (cmsg->cmsg_type) {
  799. case RDS_CMSG_RDMA_ARGS:
  800. ret = rds_cmsg_rdma_args(rs, rm, cmsg);
  801. break;
  802. case RDS_CMSG_RDMA_DEST:
  803. ret = rds_cmsg_rdma_dest(rs, rm, cmsg);
  804. break;
  805. case RDS_CMSG_RDMA_MAP:
  806. ret = rds_cmsg_rdma_map(rs, rm, cmsg);
  807. if (!ret)
  808. *allocated_mr = 1;
  809. else if (ret == -ENODEV)
  810. /* Accommodate the get_mr() case which can fail
  811. * if connection isn't established yet.
  812. */
  813. ret = -EAGAIN;
  814. break;
  815. case RDS_CMSG_ATOMIC_CSWP:
  816. case RDS_CMSG_ATOMIC_FADD:
  817. case RDS_CMSG_MASKED_ATOMIC_CSWP:
  818. case RDS_CMSG_MASKED_ATOMIC_FADD:
  819. ret = rds_cmsg_atomic(rs, rm, cmsg);
  820. break;
  821. default:
  822. return -EINVAL;
  823. }
  824. if (ret)
  825. break;
  826. }
  827. return ret;
  828. }
  829. static void rds_send_ping(struct rds_connection *conn);
  830. static int rds_send_mprds_hash(struct rds_sock *rs, struct rds_connection *conn)
  831. {
  832. int hash;
  833. if (conn->c_npaths == 0)
  834. hash = RDS_MPATH_HASH(rs, RDS_MPATH_WORKERS);
  835. else
  836. hash = RDS_MPATH_HASH(rs, conn->c_npaths);
  837. if (conn->c_npaths == 0 && hash != 0) {
  838. rds_send_ping(conn);
  839. if (conn->c_npaths == 0) {
  840. wait_event_interruptible(conn->c_hs_waitq,
  841. (conn->c_npaths != 0));
  842. }
  843. if (conn->c_npaths == 1)
  844. hash = 0;
  845. }
  846. return hash;
  847. }
  848. static int rds_rdma_bytes(struct msghdr *msg, size_t *rdma_bytes)
  849. {
  850. struct rds_rdma_args *args;
  851. struct cmsghdr *cmsg;
  852. for_each_cmsghdr(cmsg, msg) {
  853. if (!CMSG_OK(msg, cmsg))
  854. return -EINVAL;
  855. if (cmsg->cmsg_level != SOL_RDS)
  856. continue;
  857. if (cmsg->cmsg_type == RDS_CMSG_RDMA_ARGS) {
  858. args = CMSG_DATA(cmsg);
  859. *rdma_bytes += args->remote_vec.bytes;
  860. }
  861. }
  862. return 0;
  863. }
  864. int rds_sendmsg(struct socket *sock, struct msghdr *msg, size_t payload_len)
  865. {
  866. struct sock *sk = sock->sk;
  867. struct rds_sock *rs = rds_sk_to_rs(sk);
  868. DECLARE_SOCKADDR(struct sockaddr_in *, usin, msg->msg_name);
  869. __be32 daddr;
  870. __be16 dport;
  871. struct rds_message *rm = NULL;
  872. struct rds_connection *conn;
  873. int ret = 0;
  874. int queued = 0, allocated_mr = 0;
  875. int nonblock = msg->msg_flags & MSG_DONTWAIT;
  876. long timeo = sock_sndtimeo(sk, nonblock);
  877. struct rds_conn_path *cpath;
  878. size_t total_payload_len = payload_len, rdma_payload_len = 0;
  879. /* Mirror Linux UDP mirror of BSD error message compatibility */
  880. /* XXX: Perhaps MSG_MORE someday */
  881. if (msg->msg_flags & ~(MSG_DONTWAIT | MSG_CMSG_COMPAT)) {
  882. ret = -EOPNOTSUPP;
  883. goto out;
  884. }
  885. if (msg->msg_namelen) {
  886. /* XXX fail non-unicast destination IPs? */
  887. if (msg->msg_namelen < sizeof(*usin) || usin->sin_family != AF_INET) {
  888. ret = -EINVAL;
  889. goto out;
  890. }
  891. daddr = usin->sin_addr.s_addr;
  892. dport = usin->sin_port;
  893. } else {
  894. /* We only care about consistency with ->connect() */
  895. lock_sock(sk);
  896. daddr = rs->rs_conn_addr;
  897. dport = rs->rs_conn_port;
  898. release_sock(sk);
  899. }
  900. lock_sock(sk);
  901. if (daddr == 0 || rs->rs_bound_addr == 0) {
  902. release_sock(sk);
  903. ret = -ENOTCONN; /* XXX not a great errno */
  904. goto out;
  905. }
  906. release_sock(sk);
  907. ret = rds_rdma_bytes(msg, &rdma_payload_len);
  908. if (ret)
  909. goto out;
  910. total_payload_len += rdma_payload_len;
  911. if (max_t(size_t, payload_len, rdma_payload_len) > RDS_MAX_MSG_SIZE) {
  912. ret = -EMSGSIZE;
  913. goto out;
  914. }
  915. if (payload_len > rds_sk_sndbuf(rs)) {
  916. ret = -EMSGSIZE;
  917. goto out;
  918. }
  919. /* size of rm including all sgs */
  920. ret = rds_rm_size(msg, payload_len);
  921. if (ret < 0)
  922. goto out;
  923. rm = rds_message_alloc(ret, GFP_KERNEL);
  924. if (!rm) {
  925. ret = -ENOMEM;
  926. goto out;
  927. }
  928. /* Attach data to the rm */
  929. if (payload_len) {
  930. rm->data.op_sg = rds_message_alloc_sgs(rm, ceil(payload_len, PAGE_SIZE));
  931. if (!rm->data.op_sg) {
  932. ret = -ENOMEM;
  933. goto out;
  934. }
  935. ret = rds_message_copy_from_user(rm, &msg->msg_iter);
  936. if (ret)
  937. goto out;
  938. }
  939. rm->data.op_active = 1;
  940. rm->m_daddr = daddr;
  941. /* rds_conn_create has a spinlock that runs with IRQ off.
  942. * Caching the conn in the socket helps a lot. */
  943. if (rs->rs_conn && rs->rs_conn->c_faddr == daddr)
  944. conn = rs->rs_conn;
  945. else {
  946. conn = rds_conn_create_outgoing(sock_net(sock->sk),
  947. rs->rs_bound_addr, daddr,
  948. rs->rs_transport,
  949. sock->sk->sk_allocation);
  950. if (IS_ERR(conn)) {
  951. ret = PTR_ERR(conn);
  952. goto out;
  953. }
  954. rs->rs_conn = conn;
  955. }
  956. /* Parse any control messages the user may have included. */
  957. ret = rds_cmsg_send(rs, rm, msg, &allocated_mr);
  958. if (ret) {
  959. /* Trigger connection so that its ready for the next retry */
  960. if (ret == -EAGAIN)
  961. rds_conn_connect_if_down(conn);
  962. goto out;
  963. }
  964. if (rm->rdma.op_active && !conn->c_trans->xmit_rdma) {
  965. printk_ratelimited(KERN_NOTICE "rdma_op %p conn xmit_rdma %p\n",
  966. &rm->rdma, conn->c_trans->xmit_rdma);
  967. ret = -EOPNOTSUPP;
  968. goto out;
  969. }
  970. if (rm->atomic.op_active && !conn->c_trans->xmit_atomic) {
  971. printk_ratelimited(KERN_NOTICE "atomic_op %p conn xmit_atomic %p\n",
  972. &rm->atomic, conn->c_trans->xmit_atomic);
  973. ret = -EOPNOTSUPP;
  974. goto out;
  975. }
  976. if (conn->c_trans->t_mp_capable)
  977. cpath = &conn->c_path[rds_send_mprds_hash(rs, conn)];
  978. else
  979. cpath = &conn->c_path[0];
  980. rds_conn_path_connect_if_down(cpath);
  981. ret = rds_cong_wait(conn->c_fcong, dport, nonblock, rs);
  982. if (ret) {
  983. rs->rs_seen_congestion = 1;
  984. goto out;
  985. }
  986. while (!rds_send_queue_rm(rs, conn, cpath, rm, rs->rs_bound_port,
  987. dport, &queued)) {
  988. rds_stats_inc(s_send_queue_full);
  989. if (nonblock) {
  990. ret = -EAGAIN;
  991. goto out;
  992. }
  993. timeo = wait_event_interruptible_timeout(*sk_sleep(sk),
  994. rds_send_queue_rm(rs, conn, cpath, rm,
  995. rs->rs_bound_port,
  996. dport,
  997. &queued),
  998. timeo);
  999. rdsdebug("sendmsg woke queued %d timeo %ld\n", queued, timeo);
  1000. if (timeo > 0 || timeo == MAX_SCHEDULE_TIMEOUT)
  1001. continue;
  1002. ret = timeo;
  1003. if (ret == 0)
  1004. ret = -ETIMEDOUT;
  1005. goto out;
  1006. }
  1007. /*
  1008. * By now we've committed to the send. We reuse rds_send_worker()
  1009. * to retry sends in the rds thread if the transport asks us to.
  1010. */
  1011. rds_stats_inc(s_send_queued);
  1012. ret = rds_send_xmit(cpath);
  1013. if (ret == -ENOMEM || ret == -EAGAIN)
  1014. queue_delayed_work(rds_wq, &cpath->cp_send_w, 1);
  1015. rds_message_put(rm);
  1016. return payload_len;
  1017. out:
  1018. /* If the user included a RDMA_MAP cmsg, we allocated a MR on the fly.
  1019. * If the sendmsg goes through, we keep the MR. If it fails with EAGAIN
  1020. * or in any other way, we need to destroy the MR again */
  1021. if (allocated_mr)
  1022. rds_rdma_unuse(rs, rds_rdma_cookie_key(rm->m_rdma_cookie), 1);
  1023. if (rm)
  1024. rds_message_put(rm);
  1025. return ret;
  1026. }
  1027. /*
  1028. * send out a probe. Can be shared by rds_send_ping,
  1029. * rds_send_pong, rds_send_hb.
  1030. * rds_send_hb should use h_flags
  1031. * RDS_FLAG_HB_PING|RDS_FLAG_ACK_REQUIRED
  1032. * or
  1033. * RDS_FLAG_HB_PONG|RDS_FLAG_ACK_REQUIRED
  1034. */
  1035. static int
  1036. rds_send_probe(struct rds_conn_path *cp, __be16 sport,
  1037. __be16 dport, u8 h_flags)
  1038. {
  1039. struct rds_message *rm;
  1040. unsigned long flags;
  1041. int ret = 0;
  1042. rm = rds_message_alloc(0, GFP_ATOMIC);
  1043. if (!rm) {
  1044. ret = -ENOMEM;
  1045. goto out;
  1046. }
  1047. rm->m_daddr = cp->cp_conn->c_faddr;
  1048. rm->data.op_active = 1;
  1049. rds_conn_path_connect_if_down(cp);
  1050. ret = rds_cong_wait(cp->cp_conn->c_fcong, dport, 1, NULL);
  1051. if (ret)
  1052. goto out;
  1053. spin_lock_irqsave(&cp->cp_lock, flags);
  1054. list_add_tail(&rm->m_conn_item, &cp->cp_send_queue);
  1055. set_bit(RDS_MSG_ON_CONN, &rm->m_flags);
  1056. rds_message_addref(rm);
  1057. rm->m_inc.i_conn = cp->cp_conn;
  1058. rm->m_inc.i_conn_path = cp;
  1059. rds_message_populate_header(&rm->m_inc.i_hdr, sport, dport,
  1060. cp->cp_next_tx_seq);
  1061. rm->m_inc.i_hdr.h_flags |= h_flags;
  1062. cp->cp_next_tx_seq++;
  1063. if (RDS_HS_PROBE(sport, dport) && cp->cp_conn->c_trans->t_mp_capable) {
  1064. u16 npaths = RDS_MPATH_WORKERS;
  1065. rds_message_add_extension(&rm->m_inc.i_hdr,
  1066. RDS_EXTHDR_NPATHS, &npaths,
  1067. sizeof(npaths));
  1068. rds_message_add_extension(&rm->m_inc.i_hdr,
  1069. RDS_EXTHDR_GEN_NUM,
  1070. &cp->cp_conn->c_my_gen_num,
  1071. sizeof(u32));
  1072. }
  1073. spin_unlock_irqrestore(&cp->cp_lock, flags);
  1074. rds_stats_inc(s_send_queued);
  1075. rds_stats_inc(s_send_pong);
  1076. /* schedule the send work on rds_wq */
  1077. queue_delayed_work(rds_wq, &cp->cp_send_w, 1);
  1078. rds_message_put(rm);
  1079. return 0;
  1080. out:
  1081. if (rm)
  1082. rds_message_put(rm);
  1083. return ret;
  1084. }
  1085. int
  1086. rds_send_pong(struct rds_conn_path *cp, __be16 dport)
  1087. {
  1088. return rds_send_probe(cp, 0, dport, 0);
  1089. }
  1090. static void
  1091. rds_send_ping(struct rds_connection *conn)
  1092. {
  1093. unsigned long flags;
  1094. struct rds_conn_path *cp = &conn->c_path[0];
  1095. spin_lock_irqsave(&cp->cp_lock, flags);
  1096. if (conn->c_ping_triggered) {
  1097. spin_unlock_irqrestore(&cp->cp_lock, flags);
  1098. return;
  1099. }
  1100. conn->c_ping_triggered = 1;
  1101. spin_unlock_irqrestore(&cp->cp_lock, flags);
  1102. rds_send_probe(&conn->c_path[0], RDS_FLAG_PROBE_PORT, 0, 0);
  1103. }