svc_rdma_recvfrom.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664
  1. /*
  2. * Copyright (c) 2014 Open Grid Computing, Inc. All rights reserved.
  3. * Copyright (c) 2005-2006 Network Appliance, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the BSD-type
  9. * license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or without
  12. * modification, are permitted provided that the following conditions
  13. * are met:
  14. *
  15. * Redistributions of source code must retain the above copyright
  16. * notice, this list of conditions and the following 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 provided
  21. * with the distribution.
  22. *
  23. * Neither the name of the Network Appliance, Inc. nor the names of
  24. * its contributors may be used to endorse or promote products
  25. * derived from this software without specific prior written
  26. * permission.
  27. *
  28. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  29. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  30. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  31. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  32. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  33. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  34. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  35. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  36. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  37. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  38. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  39. *
  40. * Author: Tom Tucker <tom@opengridcomputing.com>
  41. */
  42. #include <linux/sunrpc/debug.h>
  43. #include <linux/sunrpc/rpc_rdma.h>
  44. #include <linux/spinlock.h>
  45. #include <asm/unaligned.h>
  46. #include <rdma/ib_verbs.h>
  47. #include <rdma/rdma_cm.h>
  48. #include <linux/sunrpc/svc_rdma.h>
  49. #define RPCDBG_FACILITY RPCDBG_SVCXPRT
  50. /*
  51. * Replace the pages in the rq_argpages array with the pages from the SGE in
  52. * the RDMA_RECV completion. The SGL should contain full pages up until the
  53. * last one.
  54. */
  55. static void rdma_build_arg_xdr(struct svc_rqst *rqstp,
  56. struct svc_rdma_op_ctxt *ctxt,
  57. u32 byte_count)
  58. {
  59. struct rpcrdma_msg *rmsgp;
  60. struct page *page;
  61. u32 bc;
  62. int sge_no;
  63. /* Swap the page in the SGE with the page in argpages */
  64. page = ctxt->pages[0];
  65. put_page(rqstp->rq_pages[0]);
  66. rqstp->rq_pages[0] = page;
  67. /* Set up the XDR head */
  68. rqstp->rq_arg.head[0].iov_base = page_address(page);
  69. rqstp->rq_arg.head[0].iov_len =
  70. min_t(size_t, byte_count, ctxt->sge[0].length);
  71. rqstp->rq_arg.len = byte_count;
  72. rqstp->rq_arg.buflen = byte_count;
  73. /* Compute bytes past head in the SGL */
  74. bc = byte_count - rqstp->rq_arg.head[0].iov_len;
  75. /* If data remains, store it in the pagelist */
  76. rqstp->rq_arg.page_len = bc;
  77. rqstp->rq_arg.page_base = 0;
  78. /* RDMA_NOMSG: RDMA READ data should land just after RDMA RECV data */
  79. rmsgp = (struct rpcrdma_msg *)rqstp->rq_arg.head[0].iov_base;
  80. if (rmsgp->rm_type == rdma_nomsg)
  81. rqstp->rq_arg.pages = &rqstp->rq_pages[0];
  82. else
  83. rqstp->rq_arg.pages = &rqstp->rq_pages[1];
  84. sge_no = 1;
  85. while (bc && sge_no < ctxt->count) {
  86. page = ctxt->pages[sge_no];
  87. put_page(rqstp->rq_pages[sge_no]);
  88. rqstp->rq_pages[sge_no] = page;
  89. bc -= min_t(u32, bc, ctxt->sge[sge_no].length);
  90. rqstp->rq_arg.buflen += ctxt->sge[sge_no].length;
  91. sge_no++;
  92. }
  93. rqstp->rq_respages = &rqstp->rq_pages[sge_no];
  94. rqstp->rq_next_page = rqstp->rq_respages + 1;
  95. /* If not all pages were used from the SGL, free the remaining ones */
  96. bc = sge_no;
  97. while (sge_no < ctxt->count) {
  98. page = ctxt->pages[sge_no++];
  99. put_page(page);
  100. }
  101. ctxt->count = bc;
  102. /* Set up tail */
  103. rqstp->rq_arg.tail[0].iov_base = NULL;
  104. rqstp->rq_arg.tail[0].iov_len = 0;
  105. }
  106. /* Issue an RDMA_READ using the local lkey to map the data sink */
  107. int rdma_read_chunk_lcl(struct svcxprt_rdma *xprt,
  108. struct svc_rqst *rqstp,
  109. struct svc_rdma_op_ctxt *head,
  110. int *page_no,
  111. u32 *page_offset,
  112. u32 rs_handle,
  113. u32 rs_length,
  114. u64 rs_offset,
  115. bool last)
  116. {
  117. struct ib_send_wr read_wr;
  118. int pages_needed = PAGE_ALIGN(*page_offset + rs_length) >> PAGE_SHIFT;
  119. struct svc_rdma_op_ctxt *ctxt = svc_rdma_get_context(xprt);
  120. int ret, read, pno;
  121. u32 pg_off = *page_offset;
  122. u32 pg_no = *page_no;
  123. ctxt->direction = DMA_FROM_DEVICE;
  124. ctxt->read_hdr = head;
  125. pages_needed = min_t(int, pages_needed, xprt->sc_max_sge_rd);
  126. read = min_t(int, (pages_needed << PAGE_SHIFT) - *page_offset,
  127. rs_length);
  128. for (pno = 0; pno < pages_needed; pno++) {
  129. int len = min_t(int, rs_length, PAGE_SIZE - pg_off);
  130. head->arg.pages[pg_no] = rqstp->rq_arg.pages[pg_no];
  131. head->arg.page_len += len;
  132. head->arg.len += len;
  133. if (!pg_off)
  134. head->count++;
  135. rqstp->rq_respages = &rqstp->rq_arg.pages[pg_no+1];
  136. rqstp->rq_next_page = rqstp->rq_respages + 1;
  137. ctxt->sge[pno].addr =
  138. ib_dma_map_page(xprt->sc_cm_id->device,
  139. head->arg.pages[pg_no], pg_off,
  140. PAGE_SIZE - pg_off,
  141. DMA_FROM_DEVICE);
  142. ret = ib_dma_mapping_error(xprt->sc_cm_id->device,
  143. ctxt->sge[pno].addr);
  144. if (ret)
  145. goto err;
  146. atomic_inc(&xprt->sc_dma_used);
  147. /* The lkey here is either a local dma lkey or a dma_mr lkey */
  148. ctxt->sge[pno].lkey = xprt->sc_dma_lkey;
  149. ctxt->sge[pno].length = len;
  150. ctxt->count++;
  151. /* adjust offset and wrap to next page if needed */
  152. pg_off += len;
  153. if (pg_off == PAGE_SIZE) {
  154. pg_off = 0;
  155. pg_no++;
  156. }
  157. rs_length -= len;
  158. }
  159. if (last && rs_length == 0)
  160. set_bit(RDMACTXT_F_LAST_CTXT, &ctxt->flags);
  161. else
  162. clear_bit(RDMACTXT_F_LAST_CTXT, &ctxt->flags);
  163. memset(&read_wr, 0, sizeof(read_wr));
  164. read_wr.wr_id = (unsigned long)ctxt;
  165. read_wr.opcode = IB_WR_RDMA_READ;
  166. ctxt->wr_op = read_wr.opcode;
  167. read_wr.send_flags = IB_SEND_SIGNALED;
  168. read_wr.wr.rdma.rkey = rs_handle;
  169. read_wr.wr.rdma.remote_addr = rs_offset;
  170. read_wr.sg_list = ctxt->sge;
  171. read_wr.num_sge = pages_needed;
  172. ret = svc_rdma_send(xprt, &read_wr);
  173. if (ret) {
  174. pr_err("svcrdma: Error %d posting RDMA_READ\n", ret);
  175. set_bit(XPT_CLOSE, &xprt->sc_xprt.xpt_flags);
  176. goto err;
  177. }
  178. /* return current location in page array */
  179. *page_no = pg_no;
  180. *page_offset = pg_off;
  181. ret = read;
  182. atomic_inc(&rdma_stat_read);
  183. return ret;
  184. err:
  185. svc_rdma_unmap_dma(ctxt);
  186. svc_rdma_put_context(ctxt, 0);
  187. return ret;
  188. }
  189. /* Issue an RDMA_READ using an FRMR to map the data sink */
  190. int rdma_read_chunk_frmr(struct svcxprt_rdma *xprt,
  191. struct svc_rqst *rqstp,
  192. struct svc_rdma_op_ctxt *head,
  193. int *page_no,
  194. u32 *page_offset,
  195. u32 rs_handle,
  196. u32 rs_length,
  197. u64 rs_offset,
  198. bool last)
  199. {
  200. struct ib_send_wr read_wr;
  201. struct ib_send_wr inv_wr;
  202. struct ib_send_wr fastreg_wr;
  203. u8 key;
  204. int pages_needed = PAGE_ALIGN(*page_offset + rs_length) >> PAGE_SHIFT;
  205. struct svc_rdma_op_ctxt *ctxt = svc_rdma_get_context(xprt);
  206. struct svc_rdma_fastreg_mr *frmr = svc_rdma_get_frmr(xprt);
  207. int ret, read, pno;
  208. u32 pg_off = *page_offset;
  209. u32 pg_no = *page_no;
  210. if (IS_ERR(frmr))
  211. return -ENOMEM;
  212. ctxt->direction = DMA_FROM_DEVICE;
  213. ctxt->frmr = frmr;
  214. pages_needed = min_t(int, pages_needed, xprt->sc_frmr_pg_list_len);
  215. read = min_t(int, (pages_needed << PAGE_SHIFT) - *page_offset,
  216. rs_length);
  217. frmr->kva = page_address(rqstp->rq_arg.pages[pg_no]);
  218. frmr->direction = DMA_FROM_DEVICE;
  219. frmr->access_flags = (IB_ACCESS_LOCAL_WRITE|IB_ACCESS_REMOTE_WRITE);
  220. frmr->map_len = pages_needed << PAGE_SHIFT;
  221. frmr->page_list_len = pages_needed;
  222. for (pno = 0; pno < pages_needed; pno++) {
  223. int len = min_t(int, rs_length, PAGE_SIZE - pg_off);
  224. head->arg.pages[pg_no] = rqstp->rq_arg.pages[pg_no];
  225. head->arg.page_len += len;
  226. head->arg.len += len;
  227. if (!pg_off)
  228. head->count++;
  229. rqstp->rq_respages = &rqstp->rq_arg.pages[pg_no+1];
  230. rqstp->rq_next_page = rqstp->rq_respages + 1;
  231. frmr->page_list->page_list[pno] =
  232. ib_dma_map_page(xprt->sc_cm_id->device,
  233. head->arg.pages[pg_no], 0,
  234. PAGE_SIZE, DMA_FROM_DEVICE);
  235. ret = ib_dma_mapping_error(xprt->sc_cm_id->device,
  236. frmr->page_list->page_list[pno]);
  237. if (ret)
  238. goto err;
  239. atomic_inc(&xprt->sc_dma_used);
  240. /* adjust offset and wrap to next page if needed */
  241. pg_off += len;
  242. if (pg_off == PAGE_SIZE) {
  243. pg_off = 0;
  244. pg_no++;
  245. }
  246. rs_length -= len;
  247. }
  248. if (last && rs_length == 0)
  249. set_bit(RDMACTXT_F_LAST_CTXT, &ctxt->flags);
  250. else
  251. clear_bit(RDMACTXT_F_LAST_CTXT, &ctxt->flags);
  252. /* Bump the key */
  253. key = (u8)(frmr->mr->lkey & 0x000000FF);
  254. ib_update_fast_reg_key(frmr->mr, ++key);
  255. ctxt->sge[0].addr = (unsigned long)frmr->kva + *page_offset;
  256. ctxt->sge[0].lkey = frmr->mr->lkey;
  257. ctxt->sge[0].length = read;
  258. ctxt->count = 1;
  259. ctxt->read_hdr = head;
  260. /* Prepare FASTREG WR */
  261. memset(&fastreg_wr, 0, sizeof(fastreg_wr));
  262. fastreg_wr.opcode = IB_WR_FAST_REG_MR;
  263. fastreg_wr.send_flags = IB_SEND_SIGNALED;
  264. fastreg_wr.wr.fast_reg.iova_start = (unsigned long)frmr->kva;
  265. fastreg_wr.wr.fast_reg.page_list = frmr->page_list;
  266. fastreg_wr.wr.fast_reg.page_list_len = frmr->page_list_len;
  267. fastreg_wr.wr.fast_reg.page_shift = PAGE_SHIFT;
  268. fastreg_wr.wr.fast_reg.length = frmr->map_len;
  269. fastreg_wr.wr.fast_reg.access_flags = frmr->access_flags;
  270. fastreg_wr.wr.fast_reg.rkey = frmr->mr->lkey;
  271. fastreg_wr.next = &read_wr;
  272. /* Prepare RDMA_READ */
  273. memset(&read_wr, 0, sizeof(read_wr));
  274. read_wr.send_flags = IB_SEND_SIGNALED;
  275. read_wr.wr.rdma.rkey = rs_handle;
  276. read_wr.wr.rdma.remote_addr = rs_offset;
  277. read_wr.sg_list = ctxt->sge;
  278. read_wr.num_sge = 1;
  279. if (xprt->sc_dev_caps & SVCRDMA_DEVCAP_READ_W_INV) {
  280. read_wr.opcode = IB_WR_RDMA_READ_WITH_INV;
  281. read_wr.wr_id = (unsigned long)ctxt;
  282. read_wr.ex.invalidate_rkey = ctxt->frmr->mr->lkey;
  283. } else {
  284. read_wr.opcode = IB_WR_RDMA_READ;
  285. read_wr.next = &inv_wr;
  286. /* Prepare invalidate */
  287. memset(&inv_wr, 0, sizeof(inv_wr));
  288. inv_wr.wr_id = (unsigned long)ctxt;
  289. inv_wr.opcode = IB_WR_LOCAL_INV;
  290. inv_wr.send_flags = IB_SEND_SIGNALED | IB_SEND_FENCE;
  291. inv_wr.ex.invalidate_rkey = frmr->mr->lkey;
  292. }
  293. ctxt->wr_op = read_wr.opcode;
  294. /* Post the chain */
  295. ret = svc_rdma_send(xprt, &fastreg_wr);
  296. if (ret) {
  297. pr_err("svcrdma: Error %d posting RDMA_READ\n", ret);
  298. set_bit(XPT_CLOSE, &xprt->sc_xprt.xpt_flags);
  299. goto err;
  300. }
  301. /* return current location in page array */
  302. *page_no = pg_no;
  303. *page_offset = pg_off;
  304. ret = read;
  305. atomic_inc(&rdma_stat_read);
  306. return ret;
  307. err:
  308. svc_rdma_unmap_dma(ctxt);
  309. svc_rdma_put_context(ctxt, 0);
  310. svc_rdma_put_frmr(xprt, frmr);
  311. return ret;
  312. }
  313. static unsigned int
  314. rdma_rcl_chunk_count(struct rpcrdma_read_chunk *ch)
  315. {
  316. unsigned int count;
  317. for (count = 0; ch->rc_discrim != xdr_zero; ch++)
  318. count++;
  319. return count;
  320. }
  321. /* If there was additional inline content, append it to the end of arg.pages.
  322. * Tail copy has to be done after the reader function has determined how many
  323. * pages are needed for RDMA READ.
  324. */
  325. static int
  326. rdma_copy_tail(struct svc_rqst *rqstp, struct svc_rdma_op_ctxt *head,
  327. u32 position, u32 byte_count, u32 page_offset, int page_no)
  328. {
  329. char *srcp, *destp;
  330. int ret;
  331. ret = 0;
  332. srcp = head->arg.head[0].iov_base + position;
  333. byte_count = head->arg.head[0].iov_len - position;
  334. if (byte_count > PAGE_SIZE) {
  335. dprintk("svcrdma: large tail unsupported\n");
  336. return 0;
  337. }
  338. /* Fit as much of the tail on the current page as possible */
  339. if (page_offset != PAGE_SIZE) {
  340. destp = page_address(rqstp->rq_arg.pages[page_no]);
  341. destp += page_offset;
  342. while (byte_count--) {
  343. *destp++ = *srcp++;
  344. page_offset++;
  345. if (page_offset == PAGE_SIZE && byte_count)
  346. goto more;
  347. }
  348. goto done;
  349. }
  350. more:
  351. /* Fit the rest on the next page */
  352. page_no++;
  353. destp = page_address(rqstp->rq_arg.pages[page_no]);
  354. while (byte_count--)
  355. *destp++ = *srcp++;
  356. rqstp->rq_respages = &rqstp->rq_arg.pages[page_no+1];
  357. rqstp->rq_next_page = rqstp->rq_respages + 1;
  358. done:
  359. byte_count = head->arg.head[0].iov_len - position;
  360. head->arg.page_len += byte_count;
  361. head->arg.len += byte_count;
  362. head->arg.buflen += byte_count;
  363. return 1;
  364. }
  365. static int rdma_read_chunks(struct svcxprt_rdma *xprt,
  366. struct rpcrdma_msg *rmsgp,
  367. struct svc_rqst *rqstp,
  368. struct svc_rdma_op_ctxt *head)
  369. {
  370. int page_no, ret;
  371. struct rpcrdma_read_chunk *ch;
  372. u32 handle, page_offset, byte_count;
  373. u32 position;
  374. u64 rs_offset;
  375. bool last;
  376. /* If no read list is present, return 0 */
  377. ch = svc_rdma_get_read_chunk(rmsgp);
  378. if (!ch)
  379. return 0;
  380. if (rdma_rcl_chunk_count(ch) > RPCSVC_MAXPAGES)
  381. return -EINVAL;
  382. /* The request is completed when the RDMA_READs complete. The
  383. * head context keeps all the pages that comprise the
  384. * request.
  385. */
  386. head->arg.head[0] = rqstp->rq_arg.head[0];
  387. head->arg.tail[0] = rqstp->rq_arg.tail[0];
  388. head->hdr_count = head->count;
  389. head->arg.page_base = 0;
  390. head->arg.page_len = 0;
  391. head->arg.len = rqstp->rq_arg.len;
  392. head->arg.buflen = rqstp->rq_arg.buflen;
  393. ch = (struct rpcrdma_read_chunk *)&rmsgp->rm_body.rm_chunks[0];
  394. position = be32_to_cpu(ch->rc_position);
  395. /* RDMA_NOMSG: RDMA READ data should land just after RDMA RECV data */
  396. if (position == 0) {
  397. head->arg.pages = &head->pages[0];
  398. page_offset = head->byte_len;
  399. } else {
  400. head->arg.pages = &head->pages[head->count];
  401. page_offset = 0;
  402. }
  403. ret = 0;
  404. page_no = 0;
  405. for (; ch->rc_discrim != xdr_zero; ch++) {
  406. if (be32_to_cpu(ch->rc_position) != position)
  407. goto err;
  408. handle = be32_to_cpu(ch->rc_target.rs_handle),
  409. byte_count = be32_to_cpu(ch->rc_target.rs_length);
  410. xdr_decode_hyper((__be32 *)&ch->rc_target.rs_offset,
  411. &rs_offset);
  412. while (byte_count > 0) {
  413. last = (ch + 1)->rc_discrim == xdr_zero;
  414. ret = xprt->sc_reader(xprt, rqstp, head,
  415. &page_no, &page_offset,
  416. handle, byte_count,
  417. rs_offset, last);
  418. if (ret < 0)
  419. goto err;
  420. byte_count -= ret;
  421. rs_offset += ret;
  422. head->arg.buflen += ret;
  423. }
  424. }
  425. /* Read list may need XDR round-up (see RFC 5666, s. 3.7) */
  426. if (page_offset & 3) {
  427. u32 pad = 4 - (page_offset & 3);
  428. head->arg.page_len += pad;
  429. head->arg.len += pad;
  430. head->arg.buflen += pad;
  431. page_offset += pad;
  432. }
  433. ret = 1;
  434. if (position && position < head->arg.head[0].iov_len)
  435. ret = rdma_copy_tail(rqstp, head, position,
  436. byte_count, page_offset, page_no);
  437. head->arg.head[0].iov_len = position;
  438. head->position = position;
  439. err:
  440. /* Detach arg pages. svc_recv will replenish them */
  441. for (page_no = 0;
  442. &rqstp->rq_pages[page_no] < rqstp->rq_respages; page_no++)
  443. rqstp->rq_pages[page_no] = NULL;
  444. return ret;
  445. }
  446. static int rdma_read_complete(struct svc_rqst *rqstp,
  447. struct svc_rdma_op_ctxt *head)
  448. {
  449. int page_no;
  450. int ret;
  451. /* Copy RPC pages */
  452. for (page_no = 0; page_no < head->count; page_no++) {
  453. put_page(rqstp->rq_pages[page_no]);
  454. rqstp->rq_pages[page_no] = head->pages[page_no];
  455. }
  456. /* Adjustments made for RDMA_NOMSG type requests */
  457. if (head->position == 0) {
  458. if (head->arg.len <= head->sge[0].length) {
  459. head->arg.head[0].iov_len = head->arg.len -
  460. head->byte_len;
  461. head->arg.page_len = 0;
  462. } else {
  463. head->arg.head[0].iov_len = head->sge[0].length -
  464. head->byte_len;
  465. head->arg.page_len = head->arg.len -
  466. head->sge[0].length;
  467. }
  468. }
  469. /* Point rq_arg.pages past header */
  470. rqstp->rq_arg.pages = &rqstp->rq_pages[head->hdr_count];
  471. rqstp->rq_arg.page_len = head->arg.page_len;
  472. rqstp->rq_arg.page_base = head->arg.page_base;
  473. /* rq_respages starts after the last arg page */
  474. rqstp->rq_respages = &rqstp->rq_pages[page_no];
  475. rqstp->rq_next_page = rqstp->rq_respages + 1;
  476. /* Rebuild rq_arg head and tail. */
  477. rqstp->rq_arg.head[0] = head->arg.head[0];
  478. rqstp->rq_arg.tail[0] = head->arg.tail[0];
  479. rqstp->rq_arg.len = head->arg.len;
  480. rqstp->rq_arg.buflen = head->arg.buflen;
  481. /* Free the context */
  482. svc_rdma_put_context(head, 0);
  483. /* XXX: What should this be? */
  484. rqstp->rq_prot = IPPROTO_MAX;
  485. svc_xprt_copy_addrs(rqstp, rqstp->rq_xprt);
  486. ret = rqstp->rq_arg.head[0].iov_len
  487. + rqstp->rq_arg.page_len
  488. + rqstp->rq_arg.tail[0].iov_len;
  489. dprintk("svcrdma: deferred read ret=%d, rq_arg.len=%u, "
  490. "rq_arg.head[0].iov_base=%p, rq_arg.head[0].iov_len=%zu\n",
  491. ret, rqstp->rq_arg.len, rqstp->rq_arg.head[0].iov_base,
  492. rqstp->rq_arg.head[0].iov_len);
  493. return ret;
  494. }
  495. /*
  496. * Set up the rqstp thread context to point to the RQ buffer. If
  497. * necessary, pull additional data from the client with an RDMA_READ
  498. * request.
  499. */
  500. int svc_rdma_recvfrom(struct svc_rqst *rqstp)
  501. {
  502. struct svc_xprt *xprt = rqstp->rq_xprt;
  503. struct svcxprt_rdma *rdma_xprt =
  504. container_of(xprt, struct svcxprt_rdma, sc_xprt);
  505. struct svc_rdma_op_ctxt *ctxt = NULL;
  506. struct rpcrdma_msg *rmsgp;
  507. int ret = 0;
  508. int len;
  509. dprintk("svcrdma: rqstp=%p\n", rqstp);
  510. spin_lock_bh(&rdma_xprt->sc_rq_dto_lock);
  511. if (!list_empty(&rdma_xprt->sc_read_complete_q)) {
  512. ctxt = list_entry(rdma_xprt->sc_read_complete_q.next,
  513. struct svc_rdma_op_ctxt,
  514. dto_q);
  515. list_del_init(&ctxt->dto_q);
  516. spin_unlock_bh(&rdma_xprt->sc_rq_dto_lock);
  517. return rdma_read_complete(rqstp, ctxt);
  518. } else if (!list_empty(&rdma_xprt->sc_rq_dto_q)) {
  519. ctxt = list_entry(rdma_xprt->sc_rq_dto_q.next,
  520. struct svc_rdma_op_ctxt,
  521. dto_q);
  522. list_del_init(&ctxt->dto_q);
  523. } else {
  524. atomic_inc(&rdma_stat_rq_starve);
  525. clear_bit(XPT_DATA, &xprt->xpt_flags);
  526. ctxt = NULL;
  527. }
  528. spin_unlock_bh(&rdma_xprt->sc_rq_dto_lock);
  529. if (!ctxt) {
  530. /* This is the EAGAIN path. The svc_recv routine will
  531. * return -EAGAIN, the nfsd thread will go to call into
  532. * svc_recv again and we shouldn't be on the active
  533. * transport list
  534. */
  535. if (test_bit(XPT_CLOSE, &xprt->xpt_flags))
  536. goto close_out;
  537. goto out;
  538. }
  539. dprintk("svcrdma: processing ctxt=%p on xprt=%p, rqstp=%p, status=%d\n",
  540. ctxt, rdma_xprt, rqstp, ctxt->wc_status);
  541. atomic_inc(&rdma_stat_recv);
  542. /* Build up the XDR from the receive buffers. */
  543. rdma_build_arg_xdr(rqstp, ctxt, ctxt->byte_len);
  544. /* Decode the RDMA header. */
  545. len = svc_rdma_xdr_decode_req(&rmsgp, rqstp);
  546. rqstp->rq_xprt_hlen = len;
  547. /* If the request is invalid, reply with an error */
  548. if (len < 0) {
  549. if (len == -ENOSYS)
  550. svc_rdma_send_error(rdma_xprt, rmsgp, ERR_VERS);
  551. goto close_out;
  552. }
  553. /* Read read-list data. */
  554. ret = rdma_read_chunks(rdma_xprt, rmsgp, rqstp, ctxt);
  555. if (ret > 0) {
  556. /* read-list posted, defer until data received from client. */
  557. goto defer;
  558. } else if (ret < 0) {
  559. /* Post of read-list failed, free context. */
  560. svc_rdma_put_context(ctxt, 1);
  561. return 0;
  562. }
  563. ret = rqstp->rq_arg.head[0].iov_len
  564. + rqstp->rq_arg.page_len
  565. + rqstp->rq_arg.tail[0].iov_len;
  566. svc_rdma_put_context(ctxt, 0);
  567. out:
  568. dprintk("svcrdma: ret=%d, rq_arg.len=%u, "
  569. "rq_arg.head[0].iov_base=%p, rq_arg.head[0].iov_len=%zd\n",
  570. ret, rqstp->rq_arg.len,
  571. rqstp->rq_arg.head[0].iov_base,
  572. rqstp->rq_arg.head[0].iov_len);
  573. rqstp->rq_prot = IPPROTO_MAX;
  574. svc_xprt_copy_addrs(rqstp, xprt);
  575. return ret;
  576. close_out:
  577. if (ctxt)
  578. svc_rdma_put_context(ctxt, 1);
  579. dprintk("svcrdma: transport %p is closing\n", xprt);
  580. /*
  581. * Set the close bit and enqueue it. svc_recv will see the
  582. * close bit and call svc_xprt_delete
  583. */
  584. set_bit(XPT_CLOSE, &xprt->xpt_flags);
  585. defer:
  586. return 0;
  587. }