svc_rdma_recvfrom.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539
  1. /*
  2. * Copyright (c) 2005-2006 Network Appliance, Inc. 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 BSD-type
  8. * license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions
  12. * are met:
  13. *
  14. * Redistributions of source code must retain the above copyright
  15. * notice, this list of conditions and the following disclaimer.
  16. *
  17. * Redistributions in binary form must reproduce the above
  18. * copyright notice, this list of conditions and the following
  19. * disclaimer in the documentation and/or other materials provided
  20. * with the distribution.
  21. *
  22. * Neither the name of the Network Appliance, Inc. nor the names of
  23. * its contributors may be used to endorse or promote products
  24. * derived from this software without specific prior written
  25. * permission.
  26. *
  27. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  28. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  29. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  30. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  31. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  32. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  33. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  34. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  35. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  36. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  37. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  38. *
  39. * Author: Tom Tucker <tom@opengridcomputing.com>
  40. */
  41. #include <linux/sunrpc/debug.h>
  42. #include <linux/sunrpc/rpc_rdma.h>
  43. #include <linux/spinlock.h>
  44. #include <asm/unaligned.h>
  45. #include <rdma/ib_verbs.h>
  46. #include <rdma/rdma_cm.h>
  47. #include <linux/sunrpc/svc_rdma.h>
  48. #define RPCDBG_FACILITY RPCDBG_SVCXPRT
  49. /*
  50. * Replace the pages in the rq_argpages array with the pages from the SGE in
  51. * the RDMA_RECV completion. The SGL should contain full pages up until the
  52. * last one.
  53. */
  54. static void rdma_build_arg_xdr(struct svc_rqst *rqstp,
  55. struct svc_rdma_op_ctxt *ctxt,
  56. u32 byte_count)
  57. {
  58. struct page *page;
  59. u32 bc;
  60. int sge_no;
  61. /* Swap the page in the SGE with the page in argpages */
  62. page = ctxt->pages[0];
  63. put_page(rqstp->rq_pages[0]);
  64. rqstp->rq_pages[0] = page;
  65. /* Set up the XDR head */
  66. rqstp->rq_arg.head[0].iov_base = page_address(page);
  67. rqstp->rq_arg.head[0].iov_len = min(byte_count, ctxt->sge[0].length);
  68. rqstp->rq_arg.len = byte_count;
  69. rqstp->rq_arg.buflen = byte_count;
  70. /* Compute bytes past head in the SGL */
  71. bc = byte_count - rqstp->rq_arg.head[0].iov_len;
  72. /* If data remains, store it in the pagelist */
  73. rqstp->rq_arg.page_len = bc;
  74. rqstp->rq_arg.page_base = 0;
  75. rqstp->rq_arg.pages = &rqstp->rq_pages[1];
  76. sge_no = 1;
  77. while (bc && sge_no < ctxt->count) {
  78. page = ctxt->pages[sge_no];
  79. put_page(rqstp->rq_pages[sge_no]);
  80. rqstp->rq_pages[sge_no] = page;
  81. bc -= min(bc, ctxt->sge[sge_no].length);
  82. rqstp->rq_arg.buflen += ctxt->sge[sge_no].length;
  83. sge_no++;
  84. }
  85. rqstp->rq_respages = &rqstp->rq_pages[sge_no];
  86. /* We should never run out of SGE because the limit is defined to
  87. * support the max allowed RPC data length
  88. */
  89. BUG_ON(bc && (sge_no == ctxt->count));
  90. BUG_ON((rqstp->rq_arg.head[0].iov_len + rqstp->rq_arg.page_len)
  91. != byte_count);
  92. BUG_ON(rqstp->rq_arg.len != byte_count);
  93. /* If not all pages were used from the SGL, free the remaining ones */
  94. bc = sge_no;
  95. while (sge_no < ctxt->count) {
  96. page = ctxt->pages[sge_no++];
  97. put_page(page);
  98. }
  99. ctxt->count = bc;
  100. /* Set up tail */
  101. rqstp->rq_arg.tail[0].iov_base = NULL;
  102. rqstp->rq_arg.tail[0].iov_len = 0;
  103. }
  104. /* Encode a read-chunk-list as an array of IB SGE
  105. *
  106. * Assumptions:
  107. * - chunk[0]->position points to pages[0] at an offset of 0
  108. * - pages[] is not physically or virtually contigous and consists of
  109. * PAGE_SIZE elements.
  110. *
  111. * Output:
  112. * - sge array pointing into pages[] array.
  113. * - chunk_sge array specifying sge index and count for each
  114. * chunk in the read list
  115. *
  116. */
  117. static int rdma_rcl_to_sge(struct svcxprt_rdma *xprt,
  118. struct svc_rqst *rqstp,
  119. struct svc_rdma_op_ctxt *head,
  120. struct rpcrdma_msg *rmsgp,
  121. struct svc_rdma_req_map *rpl_map,
  122. struct svc_rdma_req_map *chl_map,
  123. int ch_count,
  124. int byte_count)
  125. {
  126. int sge_no;
  127. int sge_bytes;
  128. int page_off;
  129. int page_no;
  130. int ch_bytes;
  131. int ch_no;
  132. struct rpcrdma_read_chunk *ch;
  133. sge_no = 0;
  134. page_no = 0;
  135. page_off = 0;
  136. ch = (struct rpcrdma_read_chunk *)&rmsgp->rm_body.rm_chunks[0];
  137. ch_no = 0;
  138. ch_bytes = ch->rc_target.rs_length;
  139. head->arg.head[0] = rqstp->rq_arg.head[0];
  140. head->arg.tail[0] = rqstp->rq_arg.tail[0];
  141. head->arg.pages = &head->pages[head->count];
  142. head->hdr_count = head->count; /* save count of hdr pages */
  143. head->arg.page_base = 0;
  144. head->arg.page_len = ch_bytes;
  145. head->arg.len = rqstp->rq_arg.len + ch_bytes;
  146. head->arg.buflen = rqstp->rq_arg.buflen + ch_bytes;
  147. head->count++;
  148. chl_map->ch[0].start = 0;
  149. while (byte_count) {
  150. rpl_map->sge[sge_no].iov_base =
  151. page_address(rqstp->rq_arg.pages[page_no]) + page_off;
  152. sge_bytes = min_t(int, PAGE_SIZE-page_off, ch_bytes);
  153. rpl_map->sge[sge_no].iov_len = sge_bytes;
  154. /*
  155. * Don't bump head->count here because the same page
  156. * may be used by multiple SGE.
  157. */
  158. head->arg.pages[page_no] = rqstp->rq_arg.pages[page_no];
  159. rqstp->rq_respages = &rqstp->rq_arg.pages[page_no+1];
  160. byte_count -= sge_bytes;
  161. ch_bytes -= sge_bytes;
  162. sge_no++;
  163. /*
  164. * If all bytes for this chunk have been mapped to an
  165. * SGE, move to the next SGE
  166. */
  167. if (ch_bytes == 0) {
  168. chl_map->ch[ch_no].count =
  169. sge_no - chl_map->ch[ch_no].start;
  170. ch_no++;
  171. ch++;
  172. chl_map->ch[ch_no].start = sge_no;
  173. ch_bytes = ch->rc_target.rs_length;
  174. /* If bytes remaining account for next chunk */
  175. if (byte_count) {
  176. head->arg.page_len += ch_bytes;
  177. head->arg.len += ch_bytes;
  178. head->arg.buflen += ch_bytes;
  179. }
  180. }
  181. /*
  182. * If this SGE consumed all of the page, move to the
  183. * next page
  184. */
  185. if ((sge_bytes + page_off) == PAGE_SIZE) {
  186. page_no++;
  187. page_off = 0;
  188. /*
  189. * If there are still bytes left to map, bump
  190. * the page count
  191. */
  192. if (byte_count)
  193. head->count++;
  194. } else
  195. page_off += sge_bytes;
  196. }
  197. BUG_ON(byte_count != 0);
  198. return sge_no;
  199. }
  200. static void rdma_set_ctxt_sge(struct svcxprt_rdma *xprt,
  201. struct svc_rdma_op_ctxt *ctxt,
  202. struct kvec *vec,
  203. u64 *sgl_offset,
  204. int count)
  205. {
  206. int i;
  207. ctxt->count = count;
  208. ctxt->direction = DMA_FROM_DEVICE;
  209. for (i = 0; i < count; i++) {
  210. atomic_inc(&xprt->sc_dma_used);
  211. ctxt->sge[i].addr =
  212. ib_dma_map_single(xprt->sc_cm_id->device,
  213. vec[i].iov_base, vec[i].iov_len,
  214. DMA_FROM_DEVICE);
  215. ctxt->sge[i].length = vec[i].iov_len;
  216. ctxt->sge[i].lkey = xprt->sc_phys_mr->lkey;
  217. *sgl_offset = *sgl_offset + vec[i].iov_len;
  218. }
  219. }
  220. static int rdma_read_max_sge(struct svcxprt_rdma *xprt, int sge_count)
  221. {
  222. if ((RDMA_TRANSPORT_IWARP ==
  223. rdma_node_get_transport(xprt->sc_cm_id->
  224. device->node_type))
  225. && sge_count > 1)
  226. return 1;
  227. else
  228. return min_t(int, sge_count, xprt->sc_max_sge);
  229. }
  230. /*
  231. * Use RDMA_READ to read data from the advertised client buffer into the
  232. * XDR stream starting at rq_arg.head[0].iov_base.
  233. * Each chunk in the array
  234. * contains the following fields:
  235. * discrim - '1', This isn't used for data placement
  236. * position - The xdr stream offset (the same for every chunk)
  237. * handle - RMR for client memory region
  238. * length - data transfer length
  239. * offset - 64 bit tagged offset in remote memory region
  240. *
  241. * On our side, we need to read into a pagelist. The first page immediately
  242. * follows the RPC header.
  243. *
  244. * This function returns:
  245. * 0 - No error and no read-list found.
  246. *
  247. * 1 - Successful read-list processing. The data is not yet in
  248. * the pagelist and therefore the RPC request must be deferred. The
  249. * I/O completion will enqueue the transport again and
  250. * svc_rdma_recvfrom will complete the request.
  251. *
  252. * <0 - Error processing/posting read-list.
  253. *
  254. * NOTE: The ctxt must not be touched after the last WR has been posted
  255. * because the I/O completion processing may occur on another
  256. * processor and free / modify the context. Ne touche pas!
  257. */
  258. static int rdma_read_xdr(struct svcxprt_rdma *xprt,
  259. struct rpcrdma_msg *rmsgp,
  260. struct svc_rqst *rqstp,
  261. struct svc_rdma_op_ctxt *hdr_ctxt)
  262. {
  263. struct ib_send_wr read_wr;
  264. int err = 0;
  265. int ch_no;
  266. int ch_count;
  267. int byte_count;
  268. int sge_count;
  269. u64 sgl_offset;
  270. struct rpcrdma_read_chunk *ch;
  271. struct svc_rdma_op_ctxt *ctxt = NULL;
  272. struct svc_rdma_req_map *rpl_map;
  273. struct svc_rdma_req_map *chl_map;
  274. /* If no read list is present, return 0 */
  275. ch = svc_rdma_get_read_chunk(rmsgp);
  276. if (!ch)
  277. return 0;
  278. /* Allocate temporary reply and chunk maps */
  279. rpl_map = svc_rdma_get_req_map();
  280. chl_map = svc_rdma_get_req_map();
  281. svc_rdma_rcl_chunk_counts(ch, &ch_count, &byte_count);
  282. if (ch_count > RPCSVC_MAXPAGES)
  283. return -EINVAL;
  284. sge_count = rdma_rcl_to_sge(xprt, rqstp, hdr_ctxt, rmsgp,
  285. rpl_map, chl_map,
  286. ch_count, byte_count);
  287. sgl_offset = 0;
  288. ch_no = 0;
  289. for (ch = (struct rpcrdma_read_chunk *)&rmsgp->rm_body.rm_chunks[0];
  290. ch->rc_discrim != 0; ch++, ch_no++) {
  291. next_sge:
  292. ctxt = svc_rdma_get_context(xprt);
  293. ctxt->direction = DMA_FROM_DEVICE;
  294. clear_bit(RDMACTXT_F_LAST_CTXT, &ctxt->flags);
  295. /* Prepare READ WR */
  296. memset(&read_wr, 0, sizeof read_wr);
  297. ctxt->wr_op = IB_WR_RDMA_READ;
  298. read_wr.wr_id = (unsigned long)ctxt;
  299. read_wr.opcode = IB_WR_RDMA_READ;
  300. read_wr.send_flags = IB_SEND_SIGNALED;
  301. read_wr.wr.rdma.rkey = ch->rc_target.rs_handle;
  302. read_wr.wr.rdma.remote_addr =
  303. get_unaligned(&(ch->rc_target.rs_offset)) +
  304. sgl_offset;
  305. read_wr.sg_list = ctxt->sge;
  306. read_wr.num_sge =
  307. rdma_read_max_sge(xprt, chl_map->ch[ch_no].count);
  308. rdma_set_ctxt_sge(xprt, ctxt,
  309. &rpl_map->sge[chl_map->ch[ch_no].start],
  310. &sgl_offset,
  311. read_wr.num_sge);
  312. if (((ch+1)->rc_discrim == 0) &&
  313. (read_wr.num_sge == chl_map->ch[ch_no].count)) {
  314. /*
  315. * Mark the last RDMA_READ with a bit to
  316. * indicate all RPC data has been fetched from
  317. * the client and the RPC needs to be enqueued.
  318. */
  319. set_bit(RDMACTXT_F_LAST_CTXT, &ctxt->flags);
  320. ctxt->read_hdr = hdr_ctxt;
  321. }
  322. /* Post the read */
  323. err = svc_rdma_send(xprt, &read_wr);
  324. if (err) {
  325. printk(KERN_ERR "svcrdma: Error %d posting RDMA_READ\n",
  326. err);
  327. set_bit(XPT_CLOSE, &xprt->sc_xprt.xpt_flags);
  328. svc_rdma_put_context(ctxt, 0);
  329. goto out;
  330. }
  331. atomic_inc(&rdma_stat_read);
  332. if (read_wr.num_sge < chl_map->ch[ch_no].count) {
  333. chl_map->ch[ch_no].count -= read_wr.num_sge;
  334. chl_map->ch[ch_no].start += read_wr.num_sge;
  335. goto next_sge;
  336. }
  337. sgl_offset = 0;
  338. err = 1;
  339. }
  340. out:
  341. svc_rdma_put_req_map(rpl_map);
  342. svc_rdma_put_req_map(chl_map);
  343. /* Detach arg pages. svc_recv will replenish them */
  344. for (ch_no = 0; &rqstp->rq_pages[ch_no] < rqstp->rq_respages; ch_no++)
  345. rqstp->rq_pages[ch_no] = NULL;
  346. /*
  347. * Detach res pages. svc_release must see a resused count of
  348. * zero or it will attempt to put them.
  349. */
  350. while (rqstp->rq_resused)
  351. rqstp->rq_respages[--rqstp->rq_resused] = NULL;
  352. return err;
  353. }
  354. static int rdma_read_complete(struct svc_rqst *rqstp,
  355. struct svc_rdma_op_ctxt *head)
  356. {
  357. int page_no;
  358. int ret;
  359. BUG_ON(!head);
  360. /* Copy RPC pages */
  361. for (page_no = 0; page_no < head->count; page_no++) {
  362. put_page(rqstp->rq_pages[page_no]);
  363. rqstp->rq_pages[page_no] = head->pages[page_no];
  364. }
  365. /* Point rq_arg.pages past header */
  366. rqstp->rq_arg.pages = &rqstp->rq_pages[head->hdr_count];
  367. rqstp->rq_arg.page_len = head->arg.page_len;
  368. rqstp->rq_arg.page_base = head->arg.page_base;
  369. /* rq_respages starts after the last arg page */
  370. rqstp->rq_respages = &rqstp->rq_arg.pages[page_no];
  371. rqstp->rq_resused = 0;
  372. /* Rebuild rq_arg head and tail. */
  373. rqstp->rq_arg.head[0] = head->arg.head[0];
  374. rqstp->rq_arg.tail[0] = head->arg.tail[0];
  375. rqstp->rq_arg.len = head->arg.len;
  376. rqstp->rq_arg.buflen = head->arg.buflen;
  377. /* Free the context */
  378. svc_rdma_put_context(head, 0);
  379. /* XXX: What should this be? */
  380. rqstp->rq_prot = IPPROTO_MAX;
  381. svc_xprt_copy_addrs(rqstp, rqstp->rq_xprt);
  382. ret = rqstp->rq_arg.head[0].iov_len
  383. + rqstp->rq_arg.page_len
  384. + rqstp->rq_arg.tail[0].iov_len;
  385. dprintk("svcrdma: deferred read ret=%d, rq_arg.len =%d, "
  386. "rq_arg.head[0].iov_base=%p, rq_arg.head[0].iov_len = %zd\n",
  387. ret, rqstp->rq_arg.len, rqstp->rq_arg.head[0].iov_base,
  388. rqstp->rq_arg.head[0].iov_len);
  389. svc_xprt_received(rqstp->rq_xprt);
  390. return ret;
  391. }
  392. /*
  393. * Set up the rqstp thread context to point to the RQ buffer. If
  394. * necessary, pull additional data from the client with an RDMA_READ
  395. * request.
  396. */
  397. int svc_rdma_recvfrom(struct svc_rqst *rqstp)
  398. {
  399. struct svc_xprt *xprt = rqstp->rq_xprt;
  400. struct svcxprt_rdma *rdma_xprt =
  401. container_of(xprt, struct svcxprt_rdma, sc_xprt);
  402. struct svc_rdma_op_ctxt *ctxt = NULL;
  403. struct rpcrdma_msg *rmsgp;
  404. int ret = 0;
  405. int len;
  406. dprintk("svcrdma: rqstp=%p\n", rqstp);
  407. spin_lock_bh(&rdma_xprt->sc_rq_dto_lock);
  408. if (!list_empty(&rdma_xprt->sc_read_complete_q)) {
  409. ctxt = list_entry(rdma_xprt->sc_read_complete_q.next,
  410. struct svc_rdma_op_ctxt,
  411. dto_q);
  412. list_del_init(&ctxt->dto_q);
  413. }
  414. if (ctxt) {
  415. spin_unlock_bh(&rdma_xprt->sc_rq_dto_lock);
  416. return rdma_read_complete(rqstp, ctxt);
  417. }
  418. if (!list_empty(&rdma_xprt->sc_rq_dto_q)) {
  419. ctxt = list_entry(rdma_xprt->sc_rq_dto_q.next,
  420. struct svc_rdma_op_ctxt,
  421. dto_q);
  422. list_del_init(&ctxt->dto_q);
  423. } else {
  424. atomic_inc(&rdma_stat_rq_starve);
  425. clear_bit(XPT_DATA, &xprt->xpt_flags);
  426. ctxt = NULL;
  427. }
  428. spin_unlock_bh(&rdma_xprt->sc_rq_dto_lock);
  429. if (!ctxt) {
  430. /* This is the EAGAIN path. The svc_recv routine will
  431. * return -EAGAIN, the nfsd thread will go to call into
  432. * svc_recv again and we shouldn't be on the active
  433. * transport list
  434. */
  435. if (test_bit(XPT_CLOSE, &xprt->xpt_flags))
  436. goto close_out;
  437. BUG_ON(ret);
  438. goto out;
  439. }
  440. dprintk("svcrdma: processing ctxt=%p on xprt=%p, rqstp=%p, status=%d\n",
  441. ctxt, rdma_xprt, rqstp, ctxt->wc_status);
  442. BUG_ON(ctxt->wc_status != IB_WC_SUCCESS);
  443. atomic_inc(&rdma_stat_recv);
  444. /* Build up the XDR from the receive buffers. */
  445. rdma_build_arg_xdr(rqstp, ctxt, ctxt->byte_len);
  446. /* Decode the RDMA header. */
  447. len = svc_rdma_xdr_decode_req(&rmsgp, rqstp);
  448. rqstp->rq_xprt_hlen = len;
  449. /* If the request is invalid, reply with an error */
  450. if (len < 0) {
  451. if (len == -ENOSYS)
  452. svc_rdma_send_error(rdma_xprt, rmsgp, ERR_VERS);
  453. goto close_out;
  454. }
  455. /* Read read-list data. */
  456. ret = rdma_read_xdr(rdma_xprt, rmsgp, rqstp, ctxt);
  457. if (ret > 0) {
  458. /* read-list posted, defer until data received from client. */
  459. svc_xprt_received(xprt);
  460. return 0;
  461. }
  462. if (ret < 0) {
  463. /* Post of read-list failed, free context. */
  464. svc_rdma_put_context(ctxt, 1);
  465. return 0;
  466. }
  467. ret = rqstp->rq_arg.head[0].iov_len
  468. + rqstp->rq_arg.page_len
  469. + rqstp->rq_arg.tail[0].iov_len;
  470. svc_rdma_put_context(ctxt, 0);
  471. out:
  472. dprintk("svcrdma: ret = %d, rq_arg.len =%d, "
  473. "rq_arg.head[0].iov_base=%p, rq_arg.head[0].iov_len = %zd\n",
  474. ret, rqstp->rq_arg.len,
  475. rqstp->rq_arg.head[0].iov_base,
  476. rqstp->rq_arg.head[0].iov_len);
  477. rqstp->rq_prot = IPPROTO_MAX;
  478. svc_xprt_copy_addrs(rqstp, xprt);
  479. svc_xprt_received(xprt);
  480. return ret;
  481. close_out:
  482. if (ctxt)
  483. svc_rdma_put_context(ctxt, 1);
  484. dprintk("svcrdma: transport %p is closing\n", xprt);
  485. /*
  486. * Set the close bit and enqueue it. svc_recv will see the
  487. * close bit and call svc_xprt_delete
  488. */
  489. set_bit(XPT_CLOSE, &xprt->xpt_flags);
  490. svc_xprt_received(xprt);
  491. return 0;
  492. }