iw_send.c 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975
  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 <linux/ratelimit.h>
  38. #include "rds.h"
  39. #include "iw.h"
  40. static void rds_iw_send_rdma_complete(struct rds_message *rm,
  41. int wc_status)
  42. {
  43. int notify_status;
  44. switch (wc_status) {
  45. case IB_WC_WR_FLUSH_ERR:
  46. return;
  47. case IB_WC_SUCCESS:
  48. notify_status = RDS_RDMA_SUCCESS;
  49. break;
  50. case IB_WC_REM_ACCESS_ERR:
  51. notify_status = RDS_RDMA_REMOTE_ERROR;
  52. break;
  53. default:
  54. notify_status = RDS_RDMA_OTHER_ERROR;
  55. break;
  56. }
  57. rds_rdma_send_complete(rm, notify_status);
  58. }
  59. static void rds_iw_send_unmap_rdma(struct rds_iw_connection *ic,
  60. struct rm_rdma_op *op)
  61. {
  62. if (op->op_mapped) {
  63. ib_dma_unmap_sg(ic->i_cm_id->device,
  64. op->op_sg, op->op_nents,
  65. op->op_write ? DMA_TO_DEVICE : DMA_FROM_DEVICE);
  66. op->op_mapped = 0;
  67. }
  68. }
  69. static void rds_iw_send_unmap_rm(struct rds_iw_connection *ic,
  70. struct rds_iw_send_work *send,
  71. int wc_status)
  72. {
  73. struct rds_message *rm = send->s_rm;
  74. rdsdebug("ic %p send %p rm %p\n", ic, send, rm);
  75. ib_dma_unmap_sg(ic->i_cm_id->device,
  76. rm->data.op_sg, rm->data.op_nents,
  77. DMA_TO_DEVICE);
  78. if (rm->rdma.op_active) {
  79. rds_iw_send_unmap_rdma(ic, &rm->rdma);
  80. /* If the user asked for a completion notification on this
  81. * message, we can implement three different semantics:
  82. * 1. Notify when we received the ACK on the RDS message
  83. * that was queued with the RDMA. This provides reliable
  84. * notification of RDMA status at the expense of a one-way
  85. * packet delay.
  86. * 2. Notify when the IB stack gives us the completion event for
  87. * the RDMA operation.
  88. * 3. Notify when the IB stack gives us the completion event for
  89. * the accompanying RDS messages.
  90. * Here, we implement approach #3. To implement approach #2,
  91. * call rds_rdma_send_complete from the cq_handler. To implement #1,
  92. * don't call rds_rdma_send_complete at all, and fall back to the notify
  93. * handling in the ACK processing code.
  94. *
  95. * Note: There's no need to explicitly sync any RDMA buffers using
  96. * ib_dma_sync_sg_for_cpu - the completion for the RDMA
  97. * operation itself unmapped the RDMA buffers, which takes care
  98. * of synching.
  99. */
  100. rds_iw_send_rdma_complete(rm, wc_status);
  101. if (rm->rdma.op_write)
  102. rds_stats_add(s_send_rdma_bytes, rm->rdma.op_bytes);
  103. else
  104. rds_stats_add(s_recv_rdma_bytes, rm->rdma.op_bytes);
  105. }
  106. /* If anyone waited for this message to get flushed out, wake
  107. * them up now */
  108. rds_message_unmapped(rm);
  109. rds_message_put(rm);
  110. send->s_rm = NULL;
  111. }
  112. void rds_iw_send_init_ring(struct rds_iw_connection *ic)
  113. {
  114. struct rds_iw_send_work *send;
  115. u32 i;
  116. for (i = 0, send = ic->i_sends; i < ic->i_send_ring.w_nr; i++, send++) {
  117. struct ib_sge *sge;
  118. send->s_rm = NULL;
  119. send->s_op = NULL;
  120. send->s_mapping = NULL;
  121. send->s_wr.next = NULL;
  122. send->s_wr.wr_id = i;
  123. send->s_wr.sg_list = send->s_sge;
  124. send->s_wr.num_sge = 1;
  125. send->s_wr.opcode = IB_WR_SEND;
  126. send->s_wr.send_flags = 0;
  127. send->s_wr.ex.imm_data = 0;
  128. sge = rds_iw_data_sge(ic, send->s_sge);
  129. sge->lkey = 0;
  130. sge = rds_iw_header_sge(ic, send->s_sge);
  131. sge->addr = ic->i_send_hdrs_dma + (i * sizeof(struct rds_header));
  132. sge->length = sizeof(struct rds_header);
  133. sge->lkey = 0;
  134. send->s_mr = ib_alloc_fast_reg_mr(ic->i_pd, fastreg_message_size);
  135. if (IS_ERR(send->s_mr)) {
  136. printk(KERN_WARNING "RDS/IW: ib_alloc_fast_reg_mr failed\n");
  137. break;
  138. }
  139. send->s_page_list = ib_alloc_fast_reg_page_list(
  140. ic->i_cm_id->device, fastreg_message_size);
  141. if (IS_ERR(send->s_page_list)) {
  142. printk(KERN_WARNING "RDS/IW: ib_alloc_fast_reg_page_list failed\n");
  143. break;
  144. }
  145. }
  146. }
  147. void rds_iw_send_clear_ring(struct rds_iw_connection *ic)
  148. {
  149. struct rds_iw_send_work *send;
  150. u32 i;
  151. for (i = 0, send = ic->i_sends; i < ic->i_send_ring.w_nr; i++, send++) {
  152. BUG_ON(!send->s_mr);
  153. ib_dereg_mr(send->s_mr);
  154. BUG_ON(!send->s_page_list);
  155. ib_free_fast_reg_page_list(send->s_page_list);
  156. if (send->s_wr.opcode == 0xdead)
  157. continue;
  158. if (send->s_rm)
  159. rds_iw_send_unmap_rm(ic, send, IB_WC_WR_FLUSH_ERR);
  160. if (send->s_op)
  161. rds_iw_send_unmap_rdma(ic, send->s_op);
  162. }
  163. }
  164. /*
  165. * The _oldest/_free ring operations here race cleanly with the alloc/unalloc
  166. * operations performed in the send path. As the sender allocs and potentially
  167. * unallocs the next free entry in the ring it doesn't alter which is
  168. * the next to be freed, which is what this is concerned with.
  169. */
  170. void rds_iw_send_cq_comp_handler(struct ib_cq *cq, void *context)
  171. {
  172. struct rds_connection *conn = context;
  173. struct rds_iw_connection *ic = conn->c_transport_data;
  174. struct ib_wc wc;
  175. struct rds_iw_send_work *send;
  176. u32 completed;
  177. u32 oldest;
  178. u32 i;
  179. int ret;
  180. rdsdebug("cq %p conn %p\n", cq, conn);
  181. rds_iw_stats_inc(s_iw_tx_cq_call);
  182. ret = ib_req_notify_cq(cq, IB_CQ_NEXT_COMP);
  183. if (ret)
  184. rdsdebug("ib_req_notify_cq send failed: %d\n", ret);
  185. while (ib_poll_cq(cq, 1, &wc) > 0) {
  186. rdsdebug("wc wr_id 0x%llx status %u byte_len %u imm_data %u\n",
  187. (unsigned long long)wc.wr_id, wc.status, wc.byte_len,
  188. be32_to_cpu(wc.ex.imm_data));
  189. rds_iw_stats_inc(s_iw_tx_cq_event);
  190. if (wc.status != IB_WC_SUCCESS) {
  191. printk(KERN_ERR "WC Error: status = %d opcode = %d\n", wc.status, wc.opcode);
  192. break;
  193. }
  194. if (wc.opcode == IB_WC_LOCAL_INV && wc.wr_id == RDS_IW_LOCAL_INV_WR_ID) {
  195. ic->i_fastreg_posted = 0;
  196. continue;
  197. }
  198. if (wc.opcode == IB_WC_FAST_REG_MR && wc.wr_id == RDS_IW_FAST_REG_WR_ID) {
  199. ic->i_fastreg_posted = 1;
  200. continue;
  201. }
  202. if (wc.wr_id == RDS_IW_ACK_WR_ID) {
  203. if (ic->i_ack_queued + HZ/2 < jiffies)
  204. rds_iw_stats_inc(s_iw_tx_stalled);
  205. rds_iw_ack_send_complete(ic);
  206. continue;
  207. }
  208. oldest = rds_iw_ring_oldest(&ic->i_send_ring);
  209. completed = rds_iw_ring_completed(&ic->i_send_ring, wc.wr_id, oldest);
  210. for (i = 0; i < completed; i++) {
  211. send = &ic->i_sends[oldest];
  212. /* In the error case, wc.opcode sometimes contains garbage */
  213. switch (send->s_wr.opcode) {
  214. case IB_WR_SEND:
  215. if (send->s_rm)
  216. rds_iw_send_unmap_rm(ic, send, wc.status);
  217. break;
  218. case IB_WR_FAST_REG_MR:
  219. case IB_WR_RDMA_WRITE:
  220. case IB_WR_RDMA_READ:
  221. case IB_WR_RDMA_READ_WITH_INV:
  222. /* Nothing to be done - the SG list will be unmapped
  223. * when the SEND completes. */
  224. break;
  225. default:
  226. printk_ratelimited(KERN_NOTICE
  227. "RDS/IW: %s: unexpected opcode 0x%x in WR!\n",
  228. __func__, send->s_wr.opcode);
  229. break;
  230. }
  231. send->s_wr.opcode = 0xdead;
  232. send->s_wr.num_sge = 1;
  233. if (send->s_queued + HZ/2 < jiffies)
  234. rds_iw_stats_inc(s_iw_tx_stalled);
  235. /* If a RDMA operation produced an error, signal this right
  236. * away. If we don't, the subsequent SEND that goes with this
  237. * RDMA will be canceled with ERR_WFLUSH, and the application
  238. * never learn that the RDMA failed. */
  239. if (unlikely(wc.status == IB_WC_REM_ACCESS_ERR && send->s_op)) {
  240. struct rds_message *rm;
  241. rm = rds_send_get_message(conn, send->s_op);
  242. if (rm)
  243. rds_iw_send_rdma_complete(rm, wc.status);
  244. }
  245. oldest = (oldest + 1) % ic->i_send_ring.w_nr;
  246. }
  247. rds_iw_ring_free(&ic->i_send_ring, completed);
  248. if (test_and_clear_bit(RDS_LL_SEND_FULL, &conn->c_flags) ||
  249. test_bit(0, &conn->c_map_queued))
  250. queue_delayed_work(rds_wq, &conn->c_send_w, 0);
  251. /* We expect errors as the qp is drained during shutdown */
  252. if (wc.status != IB_WC_SUCCESS && rds_conn_up(conn)) {
  253. rds_iw_conn_error(conn,
  254. "send completion on %pI4 "
  255. "had status %u, disconnecting and reconnecting\n",
  256. &conn->c_faddr, wc.status);
  257. }
  258. }
  259. }
  260. /*
  261. * This is the main function for allocating credits when sending
  262. * messages.
  263. *
  264. * Conceptually, we have two counters:
  265. * - send credits: this tells us how many WRs we're allowed
  266. * to submit without overruning the receiver's queue. For
  267. * each SEND WR we post, we decrement this by one.
  268. *
  269. * - posted credits: this tells us how many WRs we recently
  270. * posted to the receive queue. This value is transferred
  271. * to the peer as a "credit update" in a RDS header field.
  272. * Every time we transmit credits to the peer, we subtract
  273. * the amount of transferred credits from this counter.
  274. *
  275. * It is essential that we avoid situations where both sides have
  276. * exhausted their send credits, and are unable to send new credits
  277. * to the peer. We achieve this by requiring that we send at least
  278. * one credit update to the peer before exhausting our credits.
  279. * When new credits arrive, we subtract one credit that is withheld
  280. * until we've posted new buffers and are ready to transmit these
  281. * credits (see rds_iw_send_add_credits below).
  282. *
  283. * The RDS send code is essentially single-threaded; rds_send_xmit
  284. * grabs c_send_lock to ensure exclusive access to the send ring.
  285. * However, the ACK sending code is independent and can race with
  286. * message SENDs.
  287. *
  288. * In the send path, we need to update the counters for send credits
  289. * and the counter of posted buffers atomically - when we use the
  290. * last available credit, we cannot allow another thread to race us
  291. * and grab the posted credits counter. Hence, we have to use a
  292. * spinlock to protect the credit counter, or use atomics.
  293. *
  294. * Spinlocks shared between the send and the receive path are bad,
  295. * because they create unnecessary delays. An early implementation
  296. * using a spinlock showed a 5% degradation in throughput at some
  297. * loads.
  298. *
  299. * This implementation avoids spinlocks completely, putting both
  300. * counters into a single atomic, and updating that atomic using
  301. * atomic_add (in the receive path, when receiving fresh credits),
  302. * and using atomic_cmpxchg when updating the two counters.
  303. */
  304. int rds_iw_send_grab_credits(struct rds_iw_connection *ic,
  305. u32 wanted, u32 *adv_credits, int need_posted, int max_posted)
  306. {
  307. unsigned int avail, posted, got = 0, advertise;
  308. long oldval, newval;
  309. *adv_credits = 0;
  310. if (!ic->i_flowctl)
  311. return wanted;
  312. try_again:
  313. advertise = 0;
  314. oldval = newval = atomic_read(&ic->i_credits);
  315. posted = IB_GET_POST_CREDITS(oldval);
  316. avail = IB_GET_SEND_CREDITS(oldval);
  317. rdsdebug("rds_iw_send_grab_credits(%u): credits=%u posted=%u\n",
  318. wanted, avail, posted);
  319. /* The last credit must be used to send a credit update. */
  320. if (avail && !posted)
  321. avail--;
  322. if (avail < wanted) {
  323. struct rds_connection *conn = ic->i_cm_id->context;
  324. /* Oops, there aren't that many credits left! */
  325. set_bit(RDS_LL_SEND_FULL, &conn->c_flags);
  326. got = avail;
  327. } else {
  328. /* Sometimes you get what you want, lalala. */
  329. got = wanted;
  330. }
  331. newval -= IB_SET_SEND_CREDITS(got);
  332. /*
  333. * If need_posted is non-zero, then the caller wants
  334. * the posted regardless of whether any send credits are
  335. * available.
  336. */
  337. if (posted && (got || need_posted)) {
  338. advertise = min_t(unsigned int, posted, max_posted);
  339. newval -= IB_SET_POST_CREDITS(advertise);
  340. }
  341. /* Finally bill everything */
  342. if (atomic_cmpxchg(&ic->i_credits, oldval, newval) != oldval)
  343. goto try_again;
  344. *adv_credits = advertise;
  345. return got;
  346. }
  347. void rds_iw_send_add_credits(struct rds_connection *conn, unsigned int credits)
  348. {
  349. struct rds_iw_connection *ic = conn->c_transport_data;
  350. if (credits == 0)
  351. return;
  352. rdsdebug("rds_iw_send_add_credits(%u): current=%u%s\n",
  353. credits,
  354. IB_GET_SEND_CREDITS(atomic_read(&ic->i_credits)),
  355. test_bit(RDS_LL_SEND_FULL, &conn->c_flags) ? ", ll_send_full" : "");
  356. atomic_add(IB_SET_SEND_CREDITS(credits), &ic->i_credits);
  357. if (test_and_clear_bit(RDS_LL_SEND_FULL, &conn->c_flags))
  358. queue_delayed_work(rds_wq, &conn->c_send_w, 0);
  359. WARN_ON(IB_GET_SEND_CREDITS(credits) >= 16384);
  360. rds_iw_stats_inc(s_iw_rx_credit_updates);
  361. }
  362. void rds_iw_advertise_credits(struct rds_connection *conn, unsigned int posted)
  363. {
  364. struct rds_iw_connection *ic = conn->c_transport_data;
  365. if (posted == 0)
  366. return;
  367. atomic_add(IB_SET_POST_CREDITS(posted), &ic->i_credits);
  368. /* Decide whether to send an update to the peer now.
  369. * If we would send a credit update for every single buffer we
  370. * post, we would end up with an ACK storm (ACK arrives,
  371. * consumes buffer, we refill the ring, send ACK to remote
  372. * advertising the newly posted buffer... ad inf)
  373. *
  374. * Performance pretty much depends on how often we send
  375. * credit updates - too frequent updates mean lots of ACKs.
  376. * Too infrequent updates, and the peer will run out of
  377. * credits and has to throttle.
  378. * For the time being, 16 seems to be a good compromise.
  379. */
  380. if (IB_GET_POST_CREDITS(atomic_read(&ic->i_credits)) >= 16)
  381. set_bit(IB_ACK_REQUESTED, &ic->i_ack_flags);
  382. }
  383. static inline void
  384. rds_iw_xmit_populate_wr(struct rds_iw_connection *ic,
  385. struct rds_iw_send_work *send, unsigned int pos,
  386. unsigned long buffer, unsigned int length,
  387. int send_flags)
  388. {
  389. struct ib_sge *sge;
  390. WARN_ON(pos != send - ic->i_sends);
  391. send->s_wr.send_flags = send_flags;
  392. send->s_wr.opcode = IB_WR_SEND;
  393. send->s_wr.num_sge = 2;
  394. send->s_wr.next = NULL;
  395. send->s_queued = jiffies;
  396. send->s_op = NULL;
  397. if (length != 0) {
  398. sge = rds_iw_data_sge(ic, send->s_sge);
  399. sge->addr = buffer;
  400. sge->length = length;
  401. sge->lkey = rds_iw_local_dma_lkey(ic);
  402. sge = rds_iw_header_sge(ic, send->s_sge);
  403. } else {
  404. /* We're sending a packet with no payload. There is only
  405. * one SGE */
  406. send->s_wr.num_sge = 1;
  407. sge = &send->s_sge[0];
  408. }
  409. sge->addr = ic->i_send_hdrs_dma + (pos * sizeof(struct rds_header));
  410. sge->length = sizeof(struct rds_header);
  411. sge->lkey = rds_iw_local_dma_lkey(ic);
  412. }
  413. /*
  414. * This can be called multiple times for a given message. The first time
  415. * we see a message we map its scatterlist into the IB device so that
  416. * we can provide that mapped address to the IB scatter gather entries
  417. * in the IB work requests. We translate the scatterlist into a series
  418. * of work requests that fragment the message. These work requests complete
  419. * in order so we pass ownership of the message to the completion handler
  420. * once we send the final fragment.
  421. *
  422. * The RDS core uses the c_send_lock to only enter this function once
  423. * per connection. This makes sure that the tx ring alloc/unalloc pairs
  424. * don't get out of sync and confuse the ring.
  425. */
  426. int rds_iw_xmit(struct rds_connection *conn, struct rds_message *rm,
  427. unsigned int hdr_off, unsigned int sg, unsigned int off)
  428. {
  429. struct rds_iw_connection *ic = conn->c_transport_data;
  430. struct ib_device *dev = ic->i_cm_id->device;
  431. struct rds_iw_send_work *send = NULL;
  432. struct rds_iw_send_work *first;
  433. struct rds_iw_send_work *prev;
  434. struct ib_send_wr *failed_wr;
  435. struct scatterlist *scat;
  436. u32 pos;
  437. u32 i;
  438. u32 work_alloc;
  439. u32 credit_alloc;
  440. u32 posted;
  441. u32 adv_credits = 0;
  442. int send_flags = 0;
  443. int sent;
  444. int ret;
  445. int flow_controlled = 0;
  446. BUG_ON(off % RDS_FRAG_SIZE);
  447. BUG_ON(hdr_off != 0 && hdr_off != sizeof(struct rds_header));
  448. /* Fastreg support */
  449. if (rds_rdma_cookie_key(rm->m_rdma_cookie) && !ic->i_fastreg_posted) {
  450. ret = -EAGAIN;
  451. goto out;
  452. }
  453. /* FIXME we may overallocate here */
  454. if (be32_to_cpu(rm->m_inc.i_hdr.h_len) == 0)
  455. i = 1;
  456. else
  457. i = ceil(be32_to_cpu(rm->m_inc.i_hdr.h_len), RDS_FRAG_SIZE);
  458. work_alloc = rds_iw_ring_alloc(&ic->i_send_ring, i, &pos);
  459. if (work_alloc == 0) {
  460. set_bit(RDS_LL_SEND_FULL, &conn->c_flags);
  461. rds_iw_stats_inc(s_iw_tx_ring_full);
  462. ret = -ENOMEM;
  463. goto out;
  464. }
  465. credit_alloc = work_alloc;
  466. if (ic->i_flowctl) {
  467. credit_alloc = rds_iw_send_grab_credits(ic, work_alloc, &posted, 0, RDS_MAX_ADV_CREDIT);
  468. adv_credits += posted;
  469. if (credit_alloc < work_alloc) {
  470. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc - credit_alloc);
  471. work_alloc = credit_alloc;
  472. flow_controlled++;
  473. }
  474. if (work_alloc == 0) {
  475. set_bit(RDS_LL_SEND_FULL, &conn->c_flags);
  476. rds_iw_stats_inc(s_iw_tx_throttle);
  477. ret = -ENOMEM;
  478. goto out;
  479. }
  480. }
  481. /* map the message the first time we see it */
  482. if (!ic->i_rm) {
  483. /*
  484. printk(KERN_NOTICE "rds_iw_xmit prep msg dport=%u flags=0x%x len=%d\n",
  485. be16_to_cpu(rm->m_inc.i_hdr.h_dport),
  486. rm->m_inc.i_hdr.h_flags,
  487. be32_to_cpu(rm->m_inc.i_hdr.h_len));
  488. */
  489. if (rm->data.op_nents) {
  490. rm->data.op_count = ib_dma_map_sg(dev,
  491. rm->data.op_sg,
  492. rm->data.op_nents,
  493. DMA_TO_DEVICE);
  494. rdsdebug("ic %p mapping rm %p: %d\n", ic, rm, rm->data.op_count);
  495. if (rm->data.op_count == 0) {
  496. rds_iw_stats_inc(s_iw_tx_sg_mapping_failure);
  497. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc);
  498. ret = -ENOMEM; /* XXX ? */
  499. goto out;
  500. }
  501. } else {
  502. rm->data.op_count = 0;
  503. }
  504. ic->i_unsignaled_wrs = rds_iw_sysctl_max_unsig_wrs;
  505. ic->i_unsignaled_bytes = rds_iw_sysctl_max_unsig_bytes;
  506. rds_message_addref(rm);
  507. ic->i_rm = rm;
  508. /* Finalize the header */
  509. if (test_bit(RDS_MSG_ACK_REQUIRED, &rm->m_flags))
  510. rm->m_inc.i_hdr.h_flags |= RDS_FLAG_ACK_REQUIRED;
  511. if (test_bit(RDS_MSG_RETRANSMITTED, &rm->m_flags))
  512. rm->m_inc.i_hdr.h_flags |= RDS_FLAG_RETRANSMITTED;
  513. /* If it has a RDMA op, tell the peer we did it. This is
  514. * used by the peer to release use-once RDMA MRs. */
  515. if (rm->rdma.op_active) {
  516. struct rds_ext_header_rdma ext_hdr;
  517. ext_hdr.h_rdma_rkey = cpu_to_be32(rm->rdma.op_rkey);
  518. rds_message_add_extension(&rm->m_inc.i_hdr,
  519. RDS_EXTHDR_RDMA, &ext_hdr, sizeof(ext_hdr));
  520. }
  521. if (rm->m_rdma_cookie) {
  522. rds_message_add_rdma_dest_extension(&rm->m_inc.i_hdr,
  523. rds_rdma_cookie_key(rm->m_rdma_cookie),
  524. rds_rdma_cookie_offset(rm->m_rdma_cookie));
  525. }
  526. /* Note - rds_iw_piggyb_ack clears the ACK_REQUIRED bit, so
  527. * we should not do this unless we have a chance of at least
  528. * sticking the header into the send ring. Which is why we
  529. * should call rds_iw_ring_alloc first. */
  530. rm->m_inc.i_hdr.h_ack = cpu_to_be64(rds_iw_piggyb_ack(ic));
  531. rds_message_make_checksum(&rm->m_inc.i_hdr);
  532. /*
  533. * Update adv_credits since we reset the ACK_REQUIRED bit.
  534. */
  535. rds_iw_send_grab_credits(ic, 0, &posted, 1, RDS_MAX_ADV_CREDIT - adv_credits);
  536. adv_credits += posted;
  537. BUG_ON(adv_credits > 255);
  538. }
  539. send = &ic->i_sends[pos];
  540. first = send;
  541. prev = NULL;
  542. scat = &rm->data.op_sg[sg];
  543. sent = 0;
  544. i = 0;
  545. /* Sometimes you want to put a fence between an RDMA
  546. * READ and the following SEND.
  547. * We could either do this all the time
  548. * or when requested by the user. Right now, we let
  549. * the application choose.
  550. */
  551. if (rm->rdma.op_active && rm->rdma.op_fence)
  552. send_flags = IB_SEND_FENCE;
  553. /*
  554. * We could be copying the header into the unused tail of the page.
  555. * That would need to be changed in the future when those pages might
  556. * be mapped userspace pages or page cache pages. So instead we always
  557. * use a second sge and our long-lived ring of mapped headers. We send
  558. * the header after the data so that the data payload can be aligned on
  559. * the receiver.
  560. */
  561. /* handle a 0-len message */
  562. if (be32_to_cpu(rm->m_inc.i_hdr.h_len) == 0) {
  563. rds_iw_xmit_populate_wr(ic, send, pos, 0, 0, send_flags);
  564. goto add_header;
  565. }
  566. /* if there's data reference it with a chain of work reqs */
  567. for (; i < work_alloc && scat != &rm->data.op_sg[rm->data.op_count]; i++) {
  568. unsigned int len;
  569. send = &ic->i_sends[pos];
  570. len = min(RDS_FRAG_SIZE, ib_sg_dma_len(dev, scat) - off);
  571. rds_iw_xmit_populate_wr(ic, send, pos,
  572. ib_sg_dma_address(dev, scat) + off, len,
  573. send_flags);
  574. /*
  575. * We want to delay signaling completions just enough to get
  576. * the batching benefits but not so much that we create dead time
  577. * on the wire.
  578. */
  579. if (ic->i_unsignaled_wrs-- == 0) {
  580. ic->i_unsignaled_wrs = rds_iw_sysctl_max_unsig_wrs;
  581. send->s_wr.send_flags |= IB_SEND_SIGNALED | IB_SEND_SOLICITED;
  582. }
  583. ic->i_unsignaled_bytes -= len;
  584. if (ic->i_unsignaled_bytes <= 0) {
  585. ic->i_unsignaled_bytes = rds_iw_sysctl_max_unsig_bytes;
  586. send->s_wr.send_flags |= IB_SEND_SIGNALED | IB_SEND_SOLICITED;
  587. }
  588. /*
  589. * Always signal the last one if we're stopping due to flow control.
  590. */
  591. if (flow_controlled && i == (work_alloc-1))
  592. send->s_wr.send_flags |= IB_SEND_SIGNALED | IB_SEND_SOLICITED;
  593. rdsdebug("send %p wr %p num_sge %u next %p\n", send,
  594. &send->s_wr, send->s_wr.num_sge, send->s_wr.next);
  595. sent += len;
  596. off += len;
  597. if (off == ib_sg_dma_len(dev, scat)) {
  598. scat++;
  599. off = 0;
  600. }
  601. add_header:
  602. /* Tack on the header after the data. The header SGE should already
  603. * have been set up to point to the right header buffer. */
  604. memcpy(&ic->i_send_hdrs[pos], &rm->m_inc.i_hdr, sizeof(struct rds_header));
  605. if (0) {
  606. struct rds_header *hdr = &ic->i_send_hdrs[pos];
  607. printk(KERN_NOTICE "send WR dport=%u flags=0x%x len=%d\n",
  608. be16_to_cpu(hdr->h_dport),
  609. hdr->h_flags,
  610. be32_to_cpu(hdr->h_len));
  611. }
  612. if (adv_credits) {
  613. struct rds_header *hdr = &ic->i_send_hdrs[pos];
  614. /* add credit and redo the header checksum */
  615. hdr->h_credit = adv_credits;
  616. rds_message_make_checksum(hdr);
  617. adv_credits = 0;
  618. rds_iw_stats_inc(s_iw_tx_credit_updates);
  619. }
  620. if (prev)
  621. prev->s_wr.next = &send->s_wr;
  622. prev = send;
  623. pos = (pos + 1) % ic->i_send_ring.w_nr;
  624. }
  625. /* Account the RDS header in the number of bytes we sent, but just once.
  626. * The caller has no concept of fragmentation. */
  627. if (hdr_off == 0)
  628. sent += sizeof(struct rds_header);
  629. /* if we finished the message then send completion owns it */
  630. if (scat == &rm->data.op_sg[rm->data.op_count]) {
  631. prev->s_rm = ic->i_rm;
  632. prev->s_wr.send_flags |= IB_SEND_SIGNALED | IB_SEND_SOLICITED;
  633. ic->i_rm = NULL;
  634. }
  635. if (i < work_alloc) {
  636. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc - i);
  637. work_alloc = i;
  638. }
  639. if (ic->i_flowctl && i < credit_alloc)
  640. rds_iw_send_add_credits(conn, credit_alloc - i);
  641. /* XXX need to worry about failed_wr and partial sends. */
  642. failed_wr = &first->s_wr;
  643. ret = ib_post_send(ic->i_cm_id->qp, &first->s_wr, &failed_wr);
  644. rdsdebug("ic %p first %p (wr %p) ret %d wr %p\n", ic,
  645. first, &first->s_wr, ret, failed_wr);
  646. BUG_ON(failed_wr != &first->s_wr);
  647. if (ret) {
  648. printk(KERN_WARNING "RDS/IW: ib_post_send to %pI4 "
  649. "returned %d\n", &conn->c_faddr, ret);
  650. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc);
  651. if (prev->s_rm) {
  652. ic->i_rm = prev->s_rm;
  653. prev->s_rm = NULL;
  654. }
  655. goto out;
  656. }
  657. ret = sent;
  658. out:
  659. BUG_ON(adv_credits);
  660. return ret;
  661. }
  662. static void rds_iw_build_send_fastreg(struct rds_iw_device *rds_iwdev, struct rds_iw_connection *ic, struct rds_iw_send_work *send, int nent, int len, u64 sg_addr)
  663. {
  664. BUG_ON(nent > send->s_page_list->max_page_list_len);
  665. /*
  666. * Perform a WR for the fast_reg_mr. Each individual page
  667. * in the sg list is added to the fast reg page list and placed
  668. * inside the fast_reg_mr WR.
  669. */
  670. send->s_wr.opcode = IB_WR_FAST_REG_MR;
  671. send->s_wr.wr.fast_reg.length = len;
  672. send->s_wr.wr.fast_reg.rkey = send->s_mr->rkey;
  673. send->s_wr.wr.fast_reg.page_list = send->s_page_list;
  674. send->s_wr.wr.fast_reg.page_list_len = nent;
  675. send->s_wr.wr.fast_reg.page_shift = PAGE_SHIFT;
  676. send->s_wr.wr.fast_reg.access_flags = IB_ACCESS_REMOTE_WRITE;
  677. send->s_wr.wr.fast_reg.iova_start = sg_addr;
  678. ib_update_fast_reg_key(send->s_mr, send->s_remap_count++);
  679. }
  680. int rds_iw_xmit_rdma(struct rds_connection *conn, struct rm_rdma_op *op)
  681. {
  682. struct rds_iw_connection *ic = conn->c_transport_data;
  683. struct rds_iw_send_work *send = NULL;
  684. struct rds_iw_send_work *first;
  685. struct rds_iw_send_work *prev;
  686. struct ib_send_wr *failed_wr;
  687. struct rds_iw_device *rds_iwdev;
  688. struct scatterlist *scat;
  689. unsigned long len;
  690. u64 remote_addr = op->op_remote_addr;
  691. u32 pos, fr_pos;
  692. u32 work_alloc;
  693. u32 i;
  694. u32 j;
  695. int sent;
  696. int ret;
  697. int num_sge;
  698. rds_iwdev = ib_get_client_data(ic->i_cm_id->device, &rds_iw_client);
  699. /* map the message the first time we see it */
  700. if (!op->op_mapped) {
  701. op->op_count = ib_dma_map_sg(ic->i_cm_id->device,
  702. op->op_sg, op->op_nents, (op->op_write) ?
  703. DMA_TO_DEVICE : DMA_FROM_DEVICE);
  704. rdsdebug("ic %p mapping op %p: %d\n", ic, op, op->op_count);
  705. if (op->op_count == 0) {
  706. rds_iw_stats_inc(s_iw_tx_sg_mapping_failure);
  707. ret = -ENOMEM; /* XXX ? */
  708. goto out;
  709. }
  710. op->op_mapped = 1;
  711. }
  712. if (!op->op_write) {
  713. /* Alloc space on the send queue for the fastreg */
  714. work_alloc = rds_iw_ring_alloc(&ic->i_send_ring, 1, &fr_pos);
  715. if (work_alloc != 1) {
  716. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc);
  717. rds_iw_stats_inc(s_iw_tx_ring_full);
  718. ret = -ENOMEM;
  719. goto out;
  720. }
  721. }
  722. /*
  723. * Instead of knowing how to return a partial rdma read/write we insist that there
  724. * be enough work requests to send the entire message.
  725. */
  726. i = ceil(op->op_count, rds_iwdev->max_sge);
  727. work_alloc = rds_iw_ring_alloc(&ic->i_send_ring, i, &pos);
  728. if (work_alloc != i) {
  729. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc);
  730. rds_iw_stats_inc(s_iw_tx_ring_full);
  731. ret = -ENOMEM;
  732. goto out;
  733. }
  734. send = &ic->i_sends[pos];
  735. if (!op->op_write) {
  736. first = prev = &ic->i_sends[fr_pos];
  737. } else {
  738. first = send;
  739. prev = NULL;
  740. }
  741. scat = &op->op_sg[0];
  742. sent = 0;
  743. num_sge = op->op_count;
  744. for (i = 0; i < work_alloc && scat != &op->op_sg[op->op_count]; i++) {
  745. send->s_wr.send_flags = 0;
  746. send->s_queued = jiffies;
  747. /*
  748. * We want to delay signaling completions just enough to get
  749. * the batching benefits but not so much that we create dead time on the wire.
  750. */
  751. if (ic->i_unsignaled_wrs-- == 0) {
  752. ic->i_unsignaled_wrs = rds_iw_sysctl_max_unsig_wrs;
  753. send->s_wr.send_flags = IB_SEND_SIGNALED;
  754. }
  755. /* To avoid the need to have the plumbing to invalidate the fastreg_mr used
  756. * for local access after RDS is finished with it, using
  757. * IB_WR_RDMA_READ_WITH_INV will invalidate it after the read has completed.
  758. */
  759. if (op->op_write)
  760. send->s_wr.opcode = IB_WR_RDMA_WRITE;
  761. else
  762. send->s_wr.opcode = IB_WR_RDMA_READ_WITH_INV;
  763. send->s_wr.wr.rdma.remote_addr = remote_addr;
  764. send->s_wr.wr.rdma.rkey = op->op_rkey;
  765. send->s_op = op;
  766. if (num_sge > rds_iwdev->max_sge) {
  767. send->s_wr.num_sge = rds_iwdev->max_sge;
  768. num_sge -= rds_iwdev->max_sge;
  769. } else
  770. send->s_wr.num_sge = num_sge;
  771. send->s_wr.next = NULL;
  772. if (prev)
  773. prev->s_wr.next = &send->s_wr;
  774. for (j = 0; j < send->s_wr.num_sge && scat != &op->op_sg[op->op_count]; j++) {
  775. len = ib_sg_dma_len(ic->i_cm_id->device, scat);
  776. if (send->s_wr.opcode == IB_WR_RDMA_READ_WITH_INV)
  777. send->s_page_list->page_list[j] = ib_sg_dma_address(ic->i_cm_id->device, scat);
  778. else {
  779. send->s_sge[j].addr = ib_sg_dma_address(ic->i_cm_id->device, scat);
  780. send->s_sge[j].length = len;
  781. send->s_sge[j].lkey = rds_iw_local_dma_lkey(ic);
  782. }
  783. sent += len;
  784. rdsdebug("ic %p sent %d remote_addr %llu\n", ic, sent, remote_addr);
  785. remote_addr += len;
  786. scat++;
  787. }
  788. if (send->s_wr.opcode == IB_WR_RDMA_READ_WITH_INV) {
  789. send->s_wr.num_sge = 1;
  790. send->s_sge[0].addr = conn->c_xmit_rm->m_rs->rs_user_addr;
  791. send->s_sge[0].length = conn->c_xmit_rm->m_rs->rs_user_bytes;
  792. send->s_sge[0].lkey = ic->i_sends[fr_pos].s_mr->lkey;
  793. }
  794. rdsdebug("send %p wr %p num_sge %u next %p\n", send,
  795. &send->s_wr, send->s_wr.num_sge, send->s_wr.next);
  796. prev = send;
  797. if (++send == &ic->i_sends[ic->i_send_ring.w_nr])
  798. send = ic->i_sends;
  799. }
  800. /* if we finished the message then send completion owns it */
  801. if (scat == &op->op_sg[op->op_count])
  802. first->s_wr.send_flags = IB_SEND_SIGNALED;
  803. if (i < work_alloc) {
  804. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc - i);
  805. work_alloc = i;
  806. }
  807. /* On iWARP, local memory access by a remote system (ie, RDMA Read) is not
  808. * recommended. Putting the lkey on the wire is a security hole, as it can
  809. * allow for memory access to all of memory on the remote system. Some
  810. * adapters do not allow using the lkey for this at all. To bypass this use a
  811. * fastreg_mr (or possibly a dma_mr)
  812. */
  813. if (!op->op_write) {
  814. rds_iw_build_send_fastreg(rds_iwdev, ic, &ic->i_sends[fr_pos],
  815. op->op_count, sent, conn->c_xmit_rm->m_rs->rs_user_addr);
  816. work_alloc++;
  817. }
  818. failed_wr = &first->s_wr;
  819. ret = ib_post_send(ic->i_cm_id->qp, &first->s_wr, &failed_wr);
  820. rdsdebug("ic %p first %p (wr %p) ret %d wr %p\n", ic,
  821. first, &first->s_wr, ret, failed_wr);
  822. BUG_ON(failed_wr != &first->s_wr);
  823. if (ret) {
  824. printk(KERN_WARNING "RDS/IW: rdma ib_post_send to %pI4 "
  825. "returned %d\n", &conn->c_faddr, ret);
  826. rds_iw_ring_unalloc(&ic->i_send_ring, work_alloc);
  827. goto out;
  828. }
  829. out:
  830. return ret;
  831. }
  832. void rds_iw_xmit_complete(struct rds_connection *conn)
  833. {
  834. struct rds_iw_connection *ic = conn->c_transport_data;
  835. /* We may have a pending ACK or window update we were unable
  836. * to send previously (due to flow control). Try again. */
  837. rds_iw_attempt_ack(ic);
  838. }