send.c 34 KB

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