ib_send.c 31 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043
  1. /*
  2. * Copyright (c) 2006, 2019 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/in.h>
  35. #include <linux/device.h>
  36. #include <linux/dmapool.h>
  37. #include <linux/ratelimit.h>
  38. #include "rds_single_path.h"
  39. #include "rds.h"
  40. #include "ib.h"
  41. #include "ib_mr.h"
  42. /*
  43. * Convert IB-specific error message to RDS error message and call core
  44. * completion handler.
  45. */
  46. static void rds_ib_send_complete(struct rds_message *rm,
  47. int wc_status,
  48. void (*complete)(struct rds_message *rm, int status))
  49. {
  50. int notify_status;
  51. switch (wc_status) {
  52. case IB_WC_WR_FLUSH_ERR:
  53. return;
  54. case IB_WC_SUCCESS:
  55. notify_status = RDS_RDMA_SUCCESS;
  56. break;
  57. case IB_WC_REM_ACCESS_ERR:
  58. notify_status = RDS_RDMA_REMOTE_ERROR;
  59. break;
  60. default:
  61. notify_status = RDS_RDMA_OTHER_ERROR;
  62. break;
  63. }
  64. complete(rm, notify_status);
  65. }
  66. static void rds_ib_send_unmap_data(struct rds_ib_connection *ic,
  67. struct rm_data_op *op,
  68. int wc_status)
  69. {
  70. if (op->op_nents)
  71. ib_dma_unmap_sg(ic->i_cm_id->device,
  72. op->op_sg, op->op_nents,
  73. DMA_TO_DEVICE);
  74. }
  75. static void rds_ib_send_unmap_rdma(struct rds_ib_connection *ic,
  76. struct rm_rdma_op *op,
  77. int wc_status)
  78. {
  79. if (op->op_mapped) {
  80. ib_dma_unmap_sg(ic->i_cm_id->device,
  81. op->op_sg, op->op_nents,
  82. op->op_write ? DMA_TO_DEVICE : DMA_FROM_DEVICE);
  83. op->op_mapped = 0;
  84. }
  85. /* If the user asked for a completion notification on this
  86. * message, we can implement three different semantics:
  87. * 1. Notify when we received the ACK on the RDS message
  88. * that was queued with the RDMA. This provides reliable
  89. * notification of RDMA status at the expense of a one-way
  90. * packet delay.
  91. * 2. Notify when the IB stack gives us the completion event for
  92. * the RDMA operation.
  93. * 3. Notify when the IB stack gives us the completion event for
  94. * the accompanying RDS messages.
  95. * Here, we implement approach #3. To implement approach #2,
  96. * we would need to take an event for the rdma WR. To implement #1,
  97. * don't call rds_rdma_send_complete at all, and fall back to the notify
  98. * handling in the ACK processing code.
  99. *
  100. * Note: There's no need to explicitly sync any RDMA buffers using
  101. * ib_dma_sync_sg_for_cpu - the completion for the RDMA
  102. * operation itself unmapped the RDMA buffers, which takes care
  103. * of synching.
  104. */
  105. rds_ib_send_complete(container_of(op, struct rds_message, rdma),
  106. wc_status, rds_rdma_send_complete);
  107. if (op->op_write)
  108. rds_stats_add(s_send_rdma_bytes, op->op_bytes);
  109. else
  110. rds_stats_add(s_recv_rdma_bytes, op->op_bytes);
  111. }
  112. static void rds_ib_send_unmap_atomic(struct rds_ib_connection *ic,
  113. struct rm_atomic_op *op,
  114. int wc_status)
  115. {
  116. /* unmap atomic recvbuf */
  117. if (op->op_mapped) {
  118. ib_dma_unmap_sg(ic->i_cm_id->device, op->op_sg, 1,
  119. DMA_FROM_DEVICE);
  120. op->op_mapped = 0;
  121. }
  122. rds_ib_send_complete(container_of(op, struct rds_message, atomic),
  123. wc_status, rds_atomic_send_complete);
  124. if (op->op_type == RDS_ATOMIC_TYPE_CSWP)
  125. rds_ib_stats_inc(s_ib_atomic_cswp);
  126. else
  127. rds_ib_stats_inc(s_ib_atomic_fadd);
  128. }
  129. /*
  130. * Unmap the resources associated with a struct send_work.
  131. *
  132. * Returns the rm for no good reason other than it is unobtainable
  133. * other than by switching on wr.opcode, currently, and the caller,
  134. * the event handler, needs it.
  135. */
  136. static struct rds_message *rds_ib_send_unmap_op(struct rds_ib_connection *ic,
  137. struct rds_ib_send_work *send,
  138. int wc_status)
  139. {
  140. struct rds_message *rm = NULL;
  141. /* In the error case, wc.opcode sometimes contains garbage */
  142. switch (send->s_wr.opcode) {
  143. case IB_WR_SEND:
  144. if (send->s_op) {
  145. rm = container_of(send->s_op, struct rds_message, data);
  146. rds_ib_send_unmap_data(ic, send->s_op, wc_status);
  147. }
  148. break;
  149. case IB_WR_RDMA_WRITE:
  150. case IB_WR_RDMA_READ:
  151. if (send->s_op) {
  152. rm = container_of(send->s_op, struct rds_message, rdma);
  153. rds_ib_send_unmap_rdma(ic, send->s_op, wc_status);
  154. }
  155. break;
  156. case IB_WR_ATOMIC_FETCH_AND_ADD:
  157. case IB_WR_ATOMIC_CMP_AND_SWP:
  158. if (send->s_op) {
  159. rm = container_of(send->s_op, struct rds_message, atomic);
  160. rds_ib_send_unmap_atomic(ic, send->s_op, wc_status);
  161. }
  162. break;
  163. default:
  164. printk_ratelimited(KERN_NOTICE
  165. "RDS/IB: %s: unexpected opcode 0x%x in WR!\n",
  166. __func__, send->s_wr.opcode);
  167. break;
  168. }
  169. send->s_wr.opcode = 0xdead;
  170. return rm;
  171. }
  172. void rds_ib_send_init_ring(struct rds_ib_connection *ic)
  173. {
  174. struct rds_ib_send_work *send;
  175. u32 i;
  176. for (i = 0, send = ic->i_sends; i < ic->i_send_ring.w_nr; i++, send++) {
  177. struct ib_sge *sge;
  178. send->s_op = NULL;
  179. send->s_wr.wr_id = i;
  180. send->s_wr.sg_list = send->s_sge;
  181. send->s_wr.ex.imm_data = 0;
  182. sge = &send->s_sge[0];
  183. sge->addr = ic->i_send_hdrs_dma[i];
  184. sge->length = sizeof(struct rds_header);
  185. sge->lkey = ic->i_pd->local_dma_lkey;
  186. send->s_sge[1].lkey = ic->i_pd->local_dma_lkey;
  187. }
  188. }
  189. void rds_ib_send_clear_ring(struct rds_ib_connection *ic)
  190. {
  191. struct rds_ib_send_work *send;
  192. u32 i;
  193. for (i = 0, send = ic->i_sends; i < ic->i_send_ring.w_nr; i++, send++) {
  194. if (send->s_op && send->s_wr.opcode != 0xdead)
  195. rds_ib_send_unmap_op(ic, send, IB_WC_WR_FLUSH_ERR);
  196. }
  197. }
  198. /*
  199. * The only fast path caller always has a non-zero nr, so we don't
  200. * bother testing nr before performing the atomic sub.
  201. */
  202. static void rds_ib_sub_signaled(struct rds_ib_connection *ic, int nr)
  203. {
  204. if ((atomic_sub_return(nr, &ic->i_signaled_sends) == 0) &&
  205. waitqueue_active(&rds_ib_ring_empty_wait))
  206. wake_up(&rds_ib_ring_empty_wait);
  207. BUG_ON(atomic_read(&ic->i_signaled_sends) < 0);
  208. }
  209. /*
  210. * The _oldest/_free ring operations here race cleanly with the alloc/unalloc
  211. * operations performed in the send path. As the sender allocs and potentially
  212. * unallocs the next free entry in the ring it doesn't alter which is
  213. * the next to be freed, which is what this is concerned with.
  214. */
  215. void rds_ib_send_cqe_handler(struct rds_ib_connection *ic, struct ib_wc *wc)
  216. {
  217. struct rds_message *rm = NULL;
  218. struct rds_connection *conn = ic->conn;
  219. struct rds_ib_send_work *send;
  220. u32 completed;
  221. u32 oldest;
  222. u32 i = 0;
  223. int nr_sig = 0;
  224. rdsdebug("wc wr_id 0x%llx status %u (%s) byte_len %u imm_data %u\n",
  225. (unsigned long long)wc->wr_id, wc->status,
  226. ib_wc_status_msg(wc->status), wc->byte_len,
  227. be32_to_cpu(wc->ex.imm_data));
  228. rds_ib_stats_inc(s_ib_tx_cq_event);
  229. if (wc->wr_id == RDS_IB_ACK_WR_ID) {
  230. if (time_after(jiffies, ic->i_ack_queued + HZ / 2))
  231. rds_ib_stats_inc(s_ib_tx_stalled);
  232. rds_ib_ack_send_complete(ic);
  233. return;
  234. }
  235. oldest = rds_ib_ring_oldest(&ic->i_send_ring);
  236. completed = rds_ib_ring_completed(&ic->i_send_ring, wc->wr_id, oldest);
  237. for (i = 0; i < completed; i++) {
  238. send = &ic->i_sends[oldest];
  239. if (send->s_wr.send_flags & IB_SEND_SIGNALED)
  240. nr_sig++;
  241. rm = rds_ib_send_unmap_op(ic, send, wc->status);
  242. if (time_after(jiffies, send->s_queued + HZ / 2))
  243. rds_ib_stats_inc(s_ib_tx_stalled);
  244. if (send->s_op) {
  245. if (send->s_op == rm->m_final_op) {
  246. /* If anyone waited for this message to get
  247. * flushed out, wake them up now
  248. */
  249. rds_message_unmapped(rm);
  250. }
  251. rds_message_put(rm);
  252. send->s_op = NULL;
  253. }
  254. oldest = (oldest + 1) % ic->i_send_ring.w_nr;
  255. }
  256. rds_ib_ring_free(&ic->i_send_ring, completed);
  257. rds_ib_sub_signaled(ic, nr_sig);
  258. if (test_and_clear_bit(RDS_LL_SEND_FULL, &conn->c_flags) ||
  259. test_bit(0, &conn->c_map_queued))
  260. queue_delayed_work(conn->c_path->cp_wq, &conn->c_send_w, 0);
  261. /* We expect errors as the qp is drained during shutdown */
  262. if (wc->status != IB_WC_SUCCESS && rds_conn_up(conn)) {
  263. rds_ib_conn_error(conn, "send completion on <%pI6c,%pI6c,%d> had status %u (%s), vendor err 0x%x, disconnecting and reconnecting\n",
  264. &conn->c_laddr, &conn->c_faddr,
  265. conn->c_tos, wc->status,
  266. ib_wc_status_msg(wc->status), wc->vendor_err);
  267. }
  268. }
  269. /*
  270. * This is the main function for allocating credits when sending
  271. * messages.
  272. *
  273. * Conceptually, we have two counters:
  274. * - send credits: this tells us how many WRs we're allowed
  275. * to submit without overruning the receiver's queue. For
  276. * each SEND WR we post, we decrement this by one.
  277. *
  278. * - posted credits: this tells us how many WRs we recently
  279. * posted to the receive queue. This value is transferred
  280. * to the peer as a "credit update" in a RDS header field.
  281. * Every time we transmit credits to the peer, we subtract
  282. * the amount of transferred credits from this counter.
  283. *
  284. * It is essential that we avoid situations where both sides have
  285. * exhausted their send credits, and are unable to send new credits
  286. * to the peer. We achieve this by requiring that we send at least
  287. * one credit update to the peer before exhausting our credits.
  288. * When new credits arrive, we subtract one credit that is withheld
  289. * until we've posted new buffers and are ready to transmit these
  290. * credits (see rds_ib_send_add_credits below).
  291. *
  292. * The RDS send code is essentially single-threaded; rds_send_xmit
  293. * sets RDS_IN_XMIT to ensure exclusive access to the send ring.
  294. * However, the ACK sending code is independent and can race with
  295. * message SENDs.
  296. *
  297. * In the send path, we need to update the counters for send credits
  298. * and the counter of posted buffers atomically - when we use the
  299. * last available credit, we cannot allow another thread to race us
  300. * and grab the posted credits counter. Hence, we have to use a
  301. * spinlock to protect the credit counter, or use atomics.
  302. *
  303. * Spinlocks shared between the send and the receive path are bad,
  304. * because they create unnecessary delays. An early implementation
  305. * using a spinlock showed a 5% degradation in throughput at some
  306. * loads.
  307. *
  308. * This implementation avoids spinlocks completely, putting both
  309. * counters into a single atomic, and updating that atomic using
  310. * atomic_add (in the receive path, when receiving fresh credits),
  311. * and using atomic_cmpxchg when updating the two counters.
  312. */
  313. int rds_ib_send_grab_credits(struct rds_ib_connection *ic,
  314. u32 wanted, u32 *adv_credits, int need_posted, int max_posted)
  315. {
  316. unsigned int avail, posted, got = 0, advertise;
  317. long oldval, newval;
  318. *adv_credits = 0;
  319. if (!ic->i_flowctl)
  320. return wanted;
  321. try_again:
  322. advertise = 0;
  323. oldval = newval = atomic_read(&ic->i_credits);
  324. posted = IB_GET_POST_CREDITS(oldval);
  325. avail = IB_GET_SEND_CREDITS(oldval);
  326. rdsdebug("wanted=%u credits=%u posted=%u\n",
  327. wanted, avail, posted);
  328. /* The last credit must be used to send a credit update. */
  329. if (avail && !posted)
  330. avail--;
  331. if (avail < wanted) {
  332. struct rds_connection *conn = ic->i_cm_id->context;
  333. /* Oops, there aren't that many credits left! */
  334. set_bit(RDS_LL_SEND_FULL, &conn->c_flags);
  335. got = avail;
  336. } else {
  337. /* Sometimes you get what you want, lalala. */
  338. got = wanted;
  339. }
  340. newval -= IB_SET_SEND_CREDITS(got);
  341. /*
  342. * If need_posted is non-zero, then the caller wants
  343. * the posted regardless of whether any send credits are
  344. * available.
  345. */
  346. if (posted && (got || need_posted)) {
  347. advertise = min_t(unsigned int, posted, max_posted);
  348. newval -= IB_SET_POST_CREDITS(advertise);
  349. }
  350. /* Finally bill everything */
  351. if (atomic_cmpxchg(&ic->i_credits, oldval, newval) != oldval)
  352. goto try_again;
  353. *adv_credits = advertise;
  354. return got;
  355. }
  356. void rds_ib_send_add_credits(struct rds_connection *conn, unsigned int credits)
  357. {
  358. struct rds_ib_connection *ic = conn->c_transport_data;
  359. if (credits == 0)
  360. return;
  361. rdsdebug("credits=%u current=%u%s\n",
  362. credits,
  363. IB_GET_SEND_CREDITS(atomic_read(&ic->i_credits)),
  364. test_bit(RDS_LL_SEND_FULL, &conn->c_flags) ? ", ll_send_full" : "");
  365. atomic_add(IB_SET_SEND_CREDITS(credits), &ic->i_credits);
  366. if (test_and_clear_bit(RDS_LL_SEND_FULL, &conn->c_flags))
  367. queue_delayed_work(conn->c_path->cp_wq, &conn->c_send_w, 0);
  368. WARN_ON(IB_GET_SEND_CREDITS(credits) >= 16384);
  369. rds_ib_stats_inc(s_ib_rx_credit_updates);
  370. }
  371. void rds_ib_advertise_credits(struct rds_connection *conn, unsigned int posted)
  372. {
  373. struct rds_ib_connection *ic = conn->c_transport_data;
  374. if (posted == 0)
  375. return;
  376. atomic_add(IB_SET_POST_CREDITS(posted), &ic->i_credits);
  377. /* Decide whether to send an update to the peer now.
  378. * If we would send a credit update for every single buffer we
  379. * post, we would end up with an ACK storm (ACK arrives,
  380. * consumes buffer, we refill the ring, send ACK to remote
  381. * advertising the newly posted buffer... ad inf)
  382. *
  383. * Performance pretty much depends on how often we send
  384. * credit updates - too frequent updates mean lots of ACKs.
  385. * Too infrequent updates, and the peer will run out of
  386. * credits and has to throttle.
  387. * For the time being, 16 seems to be a good compromise.
  388. */
  389. if (IB_GET_POST_CREDITS(atomic_read(&ic->i_credits)) >= 16)
  390. set_bit(IB_ACK_REQUESTED, &ic->i_ack_flags);
  391. }
  392. static inline int rds_ib_set_wr_signal_state(struct rds_ib_connection *ic,
  393. struct rds_ib_send_work *send,
  394. bool notify)
  395. {
  396. /*
  397. * We want to delay signaling completions just enough to get
  398. * the batching benefits but not so much that we create dead time
  399. * on the wire.
  400. */
  401. if (ic->i_unsignaled_wrs-- == 0 || notify) {
  402. ic->i_unsignaled_wrs = rds_ib_sysctl_max_unsig_wrs;
  403. send->s_wr.send_flags |= IB_SEND_SIGNALED;
  404. return 1;
  405. }
  406. return 0;
  407. }
  408. /*
  409. * This can be called multiple times for a given message. The first time
  410. * we see a message we map its scatterlist into the IB device so that
  411. * we can provide that mapped address to the IB scatter gather entries
  412. * in the IB work requests. We translate the scatterlist into a series
  413. * of work requests that fragment the message. These work requests complete
  414. * in order so we pass ownership of the message to the completion handler
  415. * once we send the final fragment.
  416. *
  417. * The RDS core uses the c_send_lock to only enter this function once
  418. * per connection. This makes sure that the tx ring alloc/unalloc pairs
  419. * don't get out of sync and confuse the ring.
  420. */
  421. int rds_ib_xmit(struct rds_connection *conn, struct rds_message *rm,
  422. unsigned int hdr_off, unsigned int sg, unsigned int off)
  423. {
  424. struct rds_ib_connection *ic = conn->c_transport_data;
  425. struct ib_device *dev = ic->i_cm_id->device;
  426. struct rds_ib_send_work *send = NULL;
  427. struct rds_ib_send_work *first;
  428. struct rds_ib_send_work *prev;
  429. const struct ib_send_wr *failed_wr;
  430. struct scatterlist *scat;
  431. u32 pos;
  432. u32 i;
  433. u32 work_alloc;
  434. u32 credit_alloc = 0;
  435. u32 posted;
  436. u32 adv_credits = 0;
  437. int send_flags = 0;
  438. int bytes_sent = 0;
  439. int ret;
  440. int flow_controlled = 0;
  441. int nr_sig = 0;
  442. BUG_ON(off % RDS_FRAG_SIZE);
  443. BUG_ON(hdr_off != 0 && hdr_off != sizeof(struct rds_header));
  444. /* Do not send cong updates to IB loopback */
  445. if (conn->c_loopback
  446. && rm->m_inc.i_hdr.h_flags & RDS_FLAG_CONG_BITMAP) {
  447. rds_cong_map_updated(conn->c_fcong, ~(u64) 0);
  448. scat = &rm->data.op_sg[sg];
  449. ret = max_t(int, RDS_CONG_MAP_BYTES, scat->length);
  450. return sizeof(struct rds_header) + ret;
  451. }
  452. /* FIXME we may overallocate here */
  453. if (be32_to_cpu(rm->m_inc.i_hdr.h_len) == 0)
  454. i = 1;
  455. else
  456. i = DIV_ROUND_UP(be32_to_cpu(rm->m_inc.i_hdr.h_len), RDS_FRAG_SIZE);
  457. work_alloc = rds_ib_ring_alloc(&ic->i_send_ring, i, &pos);
  458. if (work_alloc == 0) {
  459. set_bit(RDS_LL_SEND_FULL, &conn->c_flags);
  460. rds_ib_stats_inc(s_ib_tx_ring_full);
  461. ret = -ENOMEM;
  462. goto out;
  463. }
  464. if (ic->i_flowctl) {
  465. credit_alloc = rds_ib_send_grab_credits(ic, work_alloc, &posted, 0, RDS_MAX_ADV_CREDIT);
  466. adv_credits += posted;
  467. if (credit_alloc < work_alloc) {
  468. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc - credit_alloc);
  469. work_alloc = credit_alloc;
  470. flow_controlled = 1;
  471. }
  472. if (work_alloc == 0) {
  473. set_bit(RDS_LL_SEND_FULL, &conn->c_flags);
  474. rds_ib_stats_inc(s_ib_tx_throttle);
  475. ret = -ENOMEM;
  476. goto out;
  477. }
  478. }
  479. /* map the message the first time we see it */
  480. if (!ic->i_data_op) {
  481. if (rm->data.op_nents) {
  482. rm->data.op_count = ib_dma_map_sg(dev,
  483. rm->data.op_sg,
  484. rm->data.op_nents,
  485. DMA_TO_DEVICE);
  486. rdsdebug("ic %p mapping rm %p: %d\n", ic, rm, rm->data.op_count);
  487. if (rm->data.op_count == 0) {
  488. rds_ib_stats_inc(s_ib_tx_sg_mapping_failure);
  489. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc);
  490. ret = -ENOMEM; /* XXX ? */
  491. goto out;
  492. }
  493. } else {
  494. rm->data.op_count = 0;
  495. }
  496. rds_message_addref(rm);
  497. rm->data.op_dmasg = 0;
  498. rm->data.op_dmaoff = 0;
  499. ic->i_data_op = &rm->data;
  500. /* Finalize the header */
  501. if (test_bit(RDS_MSG_ACK_REQUIRED, &rm->m_flags))
  502. rm->m_inc.i_hdr.h_flags |= RDS_FLAG_ACK_REQUIRED;
  503. if (test_bit(RDS_MSG_RETRANSMITTED, &rm->m_flags))
  504. rm->m_inc.i_hdr.h_flags |= RDS_FLAG_RETRANSMITTED;
  505. /* If it has a RDMA op, tell the peer we did it. This is
  506. * used by the peer to release use-once RDMA MRs. */
  507. if (rm->rdma.op_active) {
  508. struct rds_ext_header_rdma ext_hdr = {};
  509. struct rds_ext_header_rdma_bytes
  510. rdma_bytes_ext_hdr = {};
  511. ext_hdr.h_rdma_rkey = cpu_to_be32(rm->rdma.op_rkey);
  512. if (rds_message_add_extension(&rm->m_inc.i_hdr,
  513. RDS_EXTHDR_RDMA,
  514. &ext_hdr)) {
  515. /* prepare the rdma bytes ext header */
  516. rdma_bytes_ext_hdr.h_rflags =
  517. rm->rdma.op_write ?
  518. RDS_FLAG_RDMA_WR_BYTES :
  519. RDS_FLAG_RDMA_RD_BYTES;
  520. rdma_bytes_ext_hdr.h_rdma_bytes =
  521. cpu_to_be32(rm->rdma.op_bytes);
  522. } else {
  523. rdsdebug("RDS_EXTHDR_RDMA dropped");
  524. }
  525. if (rds_message_add_extension(&rm->m_inc.i_hdr,
  526. RDS_EXTHDR_RDMA_BYTES,
  527. &rdma_bytes_ext_hdr)) {
  528. /* rdma bytes ext header was added successfully,
  529. * notify the remote side via flag in header
  530. */
  531. rm->m_inc.i_hdr.h_flags |=
  532. RDS_FLAG_EXTHDR_EXTENSION;
  533. } else {
  534. rdsdebug("RDS_EXTHDR_RDMA_BYTES dropped");
  535. }
  536. }
  537. if (rm->m_rdma_cookie &&
  538. !rds_message_add_rdma_dest_extension(&rm->m_inc.i_hdr,
  539. rds_rdma_cookie_key(rm->m_rdma_cookie),
  540. rds_rdma_cookie_offset(rm->m_rdma_cookie))) {
  541. rdsdebug("RDS_EXTHDR_RDMA_DEST dropped\n");
  542. }
  543. /* Note - rds_ib_piggyb_ack clears the ACK_REQUIRED bit, so
  544. * we should not do this unless we have a chance of at least
  545. * sticking the header into the send ring. Which is why we
  546. * should call rds_ib_ring_alloc first. */
  547. rm->m_inc.i_hdr.h_ack = cpu_to_be64(rds_ib_piggyb_ack(ic));
  548. rds_message_make_checksum(&rm->m_inc.i_hdr);
  549. /*
  550. * Update adv_credits since we reset the ACK_REQUIRED bit.
  551. */
  552. if (ic->i_flowctl) {
  553. rds_ib_send_grab_credits(ic, 0, &posted, 1, RDS_MAX_ADV_CREDIT - adv_credits);
  554. adv_credits += posted;
  555. BUG_ON(adv_credits > 255);
  556. }
  557. }
  558. /* Sometimes you want to put a fence between an RDMA
  559. * READ and the following SEND.
  560. * We could either do this all the time
  561. * or when requested by the user. Right now, we let
  562. * the application choose.
  563. */
  564. if (rm->rdma.op_active && rm->rdma.op_fence)
  565. send_flags = IB_SEND_FENCE;
  566. /* Each frag gets a header. Msgs may be 0 bytes */
  567. send = &ic->i_sends[pos];
  568. first = send;
  569. prev = NULL;
  570. scat = &ic->i_data_op->op_sg[rm->data.op_dmasg];
  571. i = 0;
  572. do {
  573. unsigned int len = 0;
  574. /* Set up the header */
  575. send->s_wr.send_flags = send_flags;
  576. send->s_wr.opcode = IB_WR_SEND;
  577. send->s_wr.num_sge = 1;
  578. send->s_wr.next = NULL;
  579. send->s_queued = jiffies;
  580. send->s_op = NULL;
  581. send->s_sge[0].addr = ic->i_send_hdrs_dma[pos];
  582. send->s_sge[0].length = sizeof(struct rds_header);
  583. send->s_sge[0].lkey = ic->i_pd->local_dma_lkey;
  584. ib_dma_sync_single_for_cpu(ic->rds_ibdev->dev,
  585. ic->i_send_hdrs_dma[pos],
  586. sizeof(struct rds_header),
  587. DMA_TO_DEVICE);
  588. memcpy(ic->i_send_hdrs[pos], &rm->m_inc.i_hdr,
  589. sizeof(struct rds_header));
  590. /* Set up the data, if present */
  591. if (i < work_alloc
  592. && scat != &rm->data.op_sg[rm->data.op_count]) {
  593. len = min(RDS_FRAG_SIZE,
  594. sg_dma_len(scat) - rm->data.op_dmaoff);
  595. send->s_wr.num_sge = 2;
  596. send->s_sge[1].addr = sg_dma_address(scat);
  597. send->s_sge[1].addr += rm->data.op_dmaoff;
  598. send->s_sge[1].length = len;
  599. send->s_sge[1].lkey = ic->i_pd->local_dma_lkey;
  600. bytes_sent += len;
  601. rm->data.op_dmaoff += len;
  602. if (rm->data.op_dmaoff == sg_dma_len(scat)) {
  603. scat++;
  604. rm->data.op_dmasg++;
  605. rm->data.op_dmaoff = 0;
  606. }
  607. }
  608. rds_ib_set_wr_signal_state(ic, send, false);
  609. /*
  610. * Always signal the last one if we're stopping due to flow control.
  611. */
  612. if (ic->i_flowctl && flow_controlled && i == (work_alloc - 1)) {
  613. rds_ib_set_wr_signal_state(ic, send, true);
  614. send->s_wr.send_flags |= IB_SEND_SOLICITED;
  615. }
  616. if (send->s_wr.send_flags & IB_SEND_SIGNALED)
  617. nr_sig++;
  618. rdsdebug("send %p wr %p num_sge %u next %p\n", send,
  619. &send->s_wr, send->s_wr.num_sge, send->s_wr.next);
  620. if (ic->i_flowctl && adv_credits) {
  621. struct rds_header *hdr = ic->i_send_hdrs[pos];
  622. /* add credit and redo the header checksum */
  623. hdr->h_credit = adv_credits;
  624. rds_message_make_checksum(hdr);
  625. adv_credits = 0;
  626. rds_ib_stats_inc(s_ib_tx_credit_updates);
  627. }
  628. ib_dma_sync_single_for_device(ic->rds_ibdev->dev,
  629. ic->i_send_hdrs_dma[pos],
  630. sizeof(struct rds_header),
  631. DMA_TO_DEVICE);
  632. if (prev)
  633. prev->s_wr.next = &send->s_wr;
  634. prev = send;
  635. pos = (pos + 1) % ic->i_send_ring.w_nr;
  636. send = &ic->i_sends[pos];
  637. i++;
  638. } while (i < work_alloc
  639. && scat != &rm->data.op_sg[rm->data.op_count]);
  640. /* Account the RDS header in the number of bytes we sent, but just once.
  641. * The caller has no concept of fragmentation. */
  642. if (hdr_off == 0)
  643. bytes_sent += sizeof(struct rds_header);
  644. /* if we finished the message then send completion owns it */
  645. if (scat == &rm->data.op_sg[rm->data.op_count]) {
  646. prev->s_op = ic->i_data_op;
  647. prev->s_wr.send_flags |= IB_SEND_SOLICITED;
  648. if (!(prev->s_wr.send_flags & IB_SEND_SIGNALED))
  649. nr_sig += rds_ib_set_wr_signal_state(ic, prev, true);
  650. ic->i_data_op = NULL;
  651. }
  652. /* Put back wrs & credits we didn't use */
  653. if (i < work_alloc) {
  654. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc - i);
  655. work_alloc = i;
  656. }
  657. if (ic->i_flowctl && i < credit_alloc)
  658. rds_ib_send_add_credits(conn, credit_alloc - i);
  659. if (nr_sig)
  660. atomic_add(nr_sig, &ic->i_signaled_sends);
  661. /* XXX need to worry about failed_wr and partial sends. */
  662. failed_wr = &first->s_wr;
  663. ret = ib_post_send(ic->i_cm_id->qp, &first->s_wr, &failed_wr);
  664. rdsdebug("ic %p first %p (wr %p) ret %d wr %p\n", ic,
  665. first, &first->s_wr, ret, failed_wr);
  666. BUG_ON(failed_wr != &first->s_wr);
  667. if (ret) {
  668. printk(KERN_WARNING "RDS/IB: ib_post_send to %pI6c "
  669. "returned %d\n", &conn->c_faddr, ret);
  670. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc);
  671. rds_ib_sub_signaled(ic, nr_sig);
  672. if (prev->s_op) {
  673. ic->i_data_op = prev->s_op;
  674. prev->s_op = NULL;
  675. }
  676. rds_ib_conn_error(ic->conn, "ib_post_send failed\n");
  677. goto out;
  678. }
  679. ret = bytes_sent;
  680. out:
  681. BUG_ON(adv_credits);
  682. return ret;
  683. }
  684. /*
  685. * Issue atomic operation.
  686. * A simplified version of the rdma case, we always map 1 SG, and
  687. * only 8 bytes, for the return value from the atomic operation.
  688. */
  689. int rds_ib_xmit_atomic(struct rds_connection *conn, struct rm_atomic_op *op)
  690. {
  691. struct rds_ib_connection *ic = conn->c_transport_data;
  692. struct rds_ib_send_work *send = NULL;
  693. const struct ib_send_wr *failed_wr;
  694. u32 pos;
  695. u32 work_alloc;
  696. int ret;
  697. int nr_sig = 0;
  698. work_alloc = rds_ib_ring_alloc(&ic->i_send_ring, 1, &pos);
  699. if (work_alloc != 1) {
  700. rds_ib_stats_inc(s_ib_tx_ring_full);
  701. ret = -ENOMEM;
  702. goto out;
  703. }
  704. /* address of send request in ring */
  705. send = &ic->i_sends[pos];
  706. send->s_queued = jiffies;
  707. if (op->op_type == RDS_ATOMIC_TYPE_CSWP) {
  708. send->s_atomic_wr.wr.opcode = IB_WR_MASKED_ATOMIC_CMP_AND_SWP;
  709. send->s_atomic_wr.compare_add = op->op_m_cswp.compare;
  710. send->s_atomic_wr.swap = op->op_m_cswp.swap;
  711. send->s_atomic_wr.compare_add_mask = op->op_m_cswp.compare_mask;
  712. send->s_atomic_wr.swap_mask = op->op_m_cswp.swap_mask;
  713. } else { /* FADD */
  714. send->s_atomic_wr.wr.opcode = IB_WR_MASKED_ATOMIC_FETCH_AND_ADD;
  715. send->s_atomic_wr.compare_add = op->op_m_fadd.add;
  716. send->s_atomic_wr.swap = 0;
  717. send->s_atomic_wr.compare_add_mask = op->op_m_fadd.nocarry_mask;
  718. send->s_atomic_wr.swap_mask = 0;
  719. }
  720. send->s_wr.send_flags = 0;
  721. nr_sig = rds_ib_set_wr_signal_state(ic, send, op->op_notify);
  722. send->s_atomic_wr.wr.num_sge = 1;
  723. send->s_atomic_wr.wr.next = NULL;
  724. send->s_atomic_wr.remote_addr = op->op_remote_addr;
  725. send->s_atomic_wr.rkey = op->op_rkey;
  726. send->s_op = op;
  727. rds_message_addref(container_of(send->s_op, struct rds_message, atomic));
  728. /* map 8 byte retval buffer to the device */
  729. ret = ib_dma_map_sg(ic->i_cm_id->device, op->op_sg, 1, DMA_FROM_DEVICE);
  730. rdsdebug("ic %p mapping atomic op %p. mapped %d pg\n", ic, op, ret);
  731. if (ret != 1) {
  732. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc);
  733. rds_ib_stats_inc(s_ib_tx_sg_mapping_failure);
  734. ret = -ENOMEM; /* XXX ? */
  735. goto out;
  736. }
  737. /* Convert our struct scatterlist to struct ib_sge */
  738. send->s_sge[0].addr = sg_dma_address(op->op_sg);
  739. send->s_sge[0].length = sg_dma_len(op->op_sg);
  740. send->s_sge[0].lkey = ic->i_pd->local_dma_lkey;
  741. rdsdebug("rva %Lx rpa %Lx len %u\n", op->op_remote_addr,
  742. send->s_sge[0].addr, send->s_sge[0].length);
  743. if (nr_sig)
  744. atomic_add(nr_sig, &ic->i_signaled_sends);
  745. failed_wr = &send->s_atomic_wr.wr;
  746. ret = ib_post_send(ic->i_cm_id->qp, &send->s_atomic_wr.wr, &failed_wr);
  747. rdsdebug("ic %p send %p (wr %p) ret %d wr %p\n", ic,
  748. send, &send->s_atomic_wr, ret, failed_wr);
  749. BUG_ON(failed_wr != &send->s_atomic_wr.wr);
  750. if (ret) {
  751. printk(KERN_WARNING "RDS/IB: atomic ib_post_send to %pI6c "
  752. "returned %d\n", &conn->c_faddr, ret);
  753. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc);
  754. rds_ib_sub_signaled(ic, nr_sig);
  755. goto out;
  756. }
  757. if (unlikely(failed_wr != &send->s_atomic_wr.wr)) {
  758. printk(KERN_WARNING "RDS/IB: atomic ib_post_send() rc=%d, but failed_wqe updated!\n", ret);
  759. BUG_ON(failed_wr != &send->s_atomic_wr.wr);
  760. }
  761. out:
  762. return ret;
  763. }
  764. int rds_ib_xmit_rdma(struct rds_connection *conn, struct rm_rdma_op *op)
  765. {
  766. struct rds_ib_connection *ic = conn->c_transport_data;
  767. struct rds_ib_send_work *send = NULL;
  768. struct rds_ib_send_work *first;
  769. struct rds_ib_send_work *prev;
  770. const struct ib_send_wr *failed_wr;
  771. struct scatterlist *scat;
  772. unsigned long len;
  773. u64 remote_addr = op->op_remote_addr;
  774. u32 max_sge = ic->rds_ibdev->max_sge;
  775. u32 pos;
  776. u32 work_alloc;
  777. u32 i;
  778. u32 j;
  779. int sent;
  780. int ret;
  781. int num_sge;
  782. int nr_sig = 0;
  783. u64 odp_addr = op->op_odp_addr;
  784. u32 odp_lkey = 0;
  785. /* map the op the first time we see it */
  786. if (!op->op_odp_mr) {
  787. if (!op->op_mapped) {
  788. op->op_count =
  789. ib_dma_map_sg(ic->i_cm_id->device, op->op_sg,
  790. op->op_nents,
  791. (op->op_write) ? DMA_TO_DEVICE :
  792. DMA_FROM_DEVICE);
  793. rdsdebug("ic %p mapping op %p: %d\n", ic, op,
  794. op->op_count);
  795. if (op->op_count == 0) {
  796. rds_ib_stats_inc(s_ib_tx_sg_mapping_failure);
  797. ret = -ENOMEM; /* XXX ? */
  798. goto out;
  799. }
  800. op->op_mapped = 1;
  801. }
  802. } else {
  803. op->op_count = op->op_nents;
  804. odp_lkey = rds_ib_get_lkey(op->op_odp_mr->r_trans_private);
  805. }
  806. /*
  807. * Instead of knowing how to return a partial rdma read/write we insist that there
  808. * be enough work requests to send the entire message.
  809. */
  810. i = DIV_ROUND_UP(op->op_count, max_sge);
  811. work_alloc = rds_ib_ring_alloc(&ic->i_send_ring, i, &pos);
  812. if (work_alloc != i) {
  813. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc);
  814. rds_ib_stats_inc(s_ib_tx_ring_full);
  815. ret = -ENOMEM;
  816. goto out;
  817. }
  818. send = &ic->i_sends[pos];
  819. first = send;
  820. prev = NULL;
  821. scat = &op->op_sg[0];
  822. sent = 0;
  823. num_sge = op->op_count;
  824. for (i = 0; i < work_alloc && scat != &op->op_sg[op->op_count]; i++) {
  825. send->s_wr.send_flags = 0;
  826. send->s_queued = jiffies;
  827. send->s_op = NULL;
  828. if (!op->op_notify)
  829. nr_sig += rds_ib_set_wr_signal_state(ic, send,
  830. op->op_notify);
  831. send->s_wr.opcode = op->op_write ? IB_WR_RDMA_WRITE : IB_WR_RDMA_READ;
  832. send->s_rdma_wr.remote_addr = remote_addr;
  833. send->s_rdma_wr.rkey = op->op_rkey;
  834. if (num_sge > max_sge) {
  835. send->s_rdma_wr.wr.num_sge = max_sge;
  836. num_sge -= max_sge;
  837. } else {
  838. send->s_rdma_wr.wr.num_sge = num_sge;
  839. }
  840. send->s_rdma_wr.wr.next = NULL;
  841. if (prev)
  842. prev->s_rdma_wr.wr.next = &send->s_rdma_wr.wr;
  843. for (j = 0; j < send->s_rdma_wr.wr.num_sge &&
  844. scat != &op->op_sg[op->op_count]; j++) {
  845. len = sg_dma_len(scat);
  846. if (!op->op_odp_mr) {
  847. send->s_sge[j].addr = sg_dma_address(scat);
  848. send->s_sge[j].lkey = ic->i_pd->local_dma_lkey;
  849. } else {
  850. send->s_sge[j].addr = odp_addr;
  851. send->s_sge[j].lkey = odp_lkey;
  852. }
  853. send->s_sge[j].length = len;
  854. sent += len;
  855. rdsdebug("ic %p sent %d remote_addr %llu\n", ic, sent, remote_addr);
  856. remote_addr += len;
  857. odp_addr += len;
  858. scat++;
  859. }
  860. rdsdebug("send %p wr %p num_sge %u next %p\n", send,
  861. &send->s_rdma_wr.wr,
  862. send->s_rdma_wr.wr.num_sge,
  863. send->s_rdma_wr.wr.next);
  864. prev = send;
  865. if (++send == &ic->i_sends[ic->i_send_ring.w_nr])
  866. send = ic->i_sends;
  867. }
  868. /* give a reference to the last op */
  869. if (scat == &op->op_sg[op->op_count]) {
  870. prev->s_op = op;
  871. rds_message_addref(container_of(op, struct rds_message, rdma));
  872. }
  873. if (i < work_alloc) {
  874. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc - i);
  875. work_alloc = i;
  876. }
  877. if (nr_sig)
  878. atomic_add(nr_sig, &ic->i_signaled_sends);
  879. failed_wr = &first->s_rdma_wr.wr;
  880. ret = ib_post_send(ic->i_cm_id->qp, &first->s_rdma_wr.wr, &failed_wr);
  881. rdsdebug("ic %p first %p (wr %p) ret %d wr %p\n", ic,
  882. first, &first->s_rdma_wr.wr, ret, failed_wr);
  883. BUG_ON(failed_wr != &first->s_rdma_wr.wr);
  884. if (ret) {
  885. printk(KERN_WARNING "RDS/IB: rdma ib_post_send to %pI6c "
  886. "returned %d\n", &conn->c_faddr, ret);
  887. rds_ib_ring_unalloc(&ic->i_send_ring, work_alloc);
  888. rds_ib_sub_signaled(ic, nr_sig);
  889. goto out;
  890. }
  891. if (unlikely(failed_wr != &first->s_rdma_wr.wr)) {
  892. printk(KERN_WARNING "RDS/IB: ib_post_send() rc=%d, but failed_wqe updated!\n", ret);
  893. BUG_ON(failed_wr != &first->s_rdma_wr.wr);
  894. }
  895. out:
  896. return ret;
  897. }
  898. void rds_ib_xmit_path_complete(struct rds_conn_path *cp)
  899. {
  900. struct rds_connection *conn = cp->cp_conn;
  901. struct rds_ib_connection *ic = conn->c_transport_data;
  902. /* We may have a pending ACK or window update we were unable
  903. * to send previously (due to flow control). Try again. */
  904. rds_ib_attempt_ack(ic);
  905. }