ib_send.c 30 KB

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