rdma.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679
  1. /*
  2. * Copyright (c) 2007 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/pagemap.h>
  34. #include <linux/rbtree.h>
  35. #include <linux/dma-mapping.h> /* for DMA_*_DEVICE */
  36. #include "rdma.h"
  37. /*
  38. * XXX
  39. * - build with sparse
  40. * - should we limit the size of a mr region? let transport return failure?
  41. * - should we detect duplicate keys on a socket? hmm.
  42. * - an rdma is an mlock, apply rlimit?
  43. */
  44. /*
  45. * get the number of pages by looking at the page indices that the start and
  46. * end addresses fall in.
  47. *
  48. * Returns 0 if the vec is invalid. It is invalid if the number of bytes
  49. * causes the address to wrap or overflows an unsigned int. This comes
  50. * from being stored in the 'length' member of 'struct scatterlist'.
  51. */
  52. static unsigned int rds_pages_in_vec(struct rds_iovec *vec)
  53. {
  54. if ((vec->addr + vec->bytes <= vec->addr) ||
  55. (vec->bytes > (u64)UINT_MAX))
  56. return 0;
  57. return ((vec->addr + vec->bytes + PAGE_SIZE - 1) >> PAGE_SHIFT) -
  58. (vec->addr >> PAGE_SHIFT);
  59. }
  60. static struct rds_mr *rds_mr_tree_walk(struct rb_root *root, u64 key,
  61. struct rds_mr *insert)
  62. {
  63. struct rb_node **p = &root->rb_node;
  64. struct rb_node *parent = NULL;
  65. struct rds_mr *mr;
  66. while (*p) {
  67. parent = *p;
  68. mr = rb_entry(parent, struct rds_mr, r_rb_node);
  69. if (key < mr->r_key)
  70. p = &(*p)->rb_left;
  71. else if (key > mr->r_key)
  72. p = &(*p)->rb_right;
  73. else
  74. return mr;
  75. }
  76. if (insert) {
  77. rb_link_node(&insert->r_rb_node, parent, p);
  78. rb_insert_color(&insert->r_rb_node, root);
  79. atomic_inc(&insert->r_refcount);
  80. }
  81. return NULL;
  82. }
  83. /*
  84. * Destroy the transport-specific part of a MR.
  85. */
  86. static void rds_destroy_mr(struct rds_mr *mr)
  87. {
  88. struct rds_sock *rs = mr->r_sock;
  89. void *trans_private = NULL;
  90. unsigned long flags;
  91. rdsdebug("RDS: destroy mr key is %x refcnt %u\n",
  92. mr->r_key, atomic_read(&mr->r_refcount));
  93. if (test_and_set_bit(RDS_MR_DEAD, &mr->r_state))
  94. return;
  95. spin_lock_irqsave(&rs->rs_rdma_lock, flags);
  96. if (!RB_EMPTY_NODE(&mr->r_rb_node))
  97. rb_erase(&mr->r_rb_node, &rs->rs_rdma_keys);
  98. trans_private = mr->r_trans_private;
  99. mr->r_trans_private = NULL;
  100. spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
  101. if (trans_private)
  102. mr->r_trans->free_mr(trans_private, mr->r_invalidate);
  103. }
  104. void __rds_put_mr_final(struct rds_mr *mr)
  105. {
  106. rds_destroy_mr(mr);
  107. kfree(mr);
  108. }
  109. /*
  110. * By the time this is called we can't have any more ioctls called on
  111. * the socket so we don't need to worry about racing with others.
  112. */
  113. void rds_rdma_drop_keys(struct rds_sock *rs)
  114. {
  115. struct rds_mr *mr;
  116. struct rb_node *node;
  117. /* Release any MRs associated with this socket */
  118. while ((node = rb_first(&rs->rs_rdma_keys))) {
  119. mr = container_of(node, struct rds_mr, r_rb_node);
  120. if (mr->r_trans == rs->rs_transport)
  121. mr->r_invalidate = 0;
  122. rds_mr_put(mr);
  123. }
  124. if (rs->rs_transport && rs->rs_transport->flush_mrs)
  125. rs->rs_transport->flush_mrs();
  126. }
  127. /*
  128. * Helper function to pin user pages.
  129. */
  130. static int rds_pin_pages(unsigned long user_addr, unsigned int nr_pages,
  131. struct page **pages, int write)
  132. {
  133. int ret;
  134. down_read(&current->mm->mmap_sem);
  135. ret = get_user_pages(current, current->mm, user_addr,
  136. nr_pages, write, 0, pages, NULL);
  137. up_read(&current->mm->mmap_sem);
  138. if (0 <= ret && (unsigned) ret < nr_pages) {
  139. while (ret--)
  140. put_page(pages[ret]);
  141. ret = -EFAULT;
  142. }
  143. return ret;
  144. }
  145. static int __rds_rdma_map(struct rds_sock *rs, struct rds_get_mr_args *args,
  146. u64 *cookie_ret, struct rds_mr **mr_ret)
  147. {
  148. struct rds_mr *mr = NULL, *found;
  149. unsigned int nr_pages;
  150. struct page **pages = NULL;
  151. struct scatterlist *sg;
  152. void *trans_private;
  153. unsigned long flags;
  154. rds_rdma_cookie_t cookie;
  155. unsigned int nents;
  156. long i;
  157. int ret;
  158. if (rs->rs_bound_addr == 0) {
  159. ret = -ENOTCONN; /* XXX not a great errno */
  160. goto out;
  161. }
  162. if (rs->rs_transport->get_mr == NULL) {
  163. ret = -EOPNOTSUPP;
  164. goto out;
  165. }
  166. nr_pages = rds_pages_in_vec(&args->vec);
  167. if (nr_pages == 0) {
  168. ret = -EINVAL;
  169. goto out;
  170. }
  171. rdsdebug("RDS: get_mr addr %llx len %llu nr_pages %u\n",
  172. args->vec.addr, args->vec.bytes, nr_pages);
  173. /* XXX clamp nr_pages to limit the size of this alloc? */
  174. pages = kcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL);
  175. if (pages == NULL) {
  176. ret = -ENOMEM;
  177. goto out;
  178. }
  179. mr = kzalloc(sizeof(struct rds_mr), GFP_KERNEL);
  180. if (mr == NULL) {
  181. ret = -ENOMEM;
  182. goto out;
  183. }
  184. atomic_set(&mr->r_refcount, 1);
  185. RB_CLEAR_NODE(&mr->r_rb_node);
  186. mr->r_trans = rs->rs_transport;
  187. mr->r_sock = rs;
  188. if (args->flags & RDS_RDMA_USE_ONCE)
  189. mr->r_use_once = 1;
  190. if (args->flags & RDS_RDMA_INVALIDATE)
  191. mr->r_invalidate = 1;
  192. if (args->flags & RDS_RDMA_READWRITE)
  193. mr->r_write = 1;
  194. /*
  195. * Pin the pages that make up the user buffer and transfer the page
  196. * pointers to the mr's sg array. We check to see if we've mapped
  197. * the whole region after transferring the partial page references
  198. * to the sg array so that we can have one page ref cleanup path.
  199. *
  200. * For now we have no flag that tells us whether the mapping is
  201. * r/o or r/w. We need to assume r/w, or we'll do a lot of RDMA to
  202. * the zero page.
  203. */
  204. ret = rds_pin_pages(args->vec.addr & PAGE_MASK, nr_pages, pages, 1);
  205. if (ret < 0)
  206. goto out;
  207. nents = ret;
  208. sg = kcalloc(nents, sizeof(*sg), GFP_KERNEL);
  209. if (sg == NULL) {
  210. ret = -ENOMEM;
  211. goto out;
  212. }
  213. WARN_ON(!nents);
  214. sg_init_table(sg, nents);
  215. /* Stick all pages into the scatterlist */
  216. for (i = 0 ; i < nents; i++)
  217. sg_set_page(&sg[i], pages[i], PAGE_SIZE, 0);
  218. rdsdebug("RDS: trans_private nents is %u\n", nents);
  219. /* Obtain a transport specific MR. If this succeeds, the
  220. * s/g list is now owned by the MR.
  221. * Note that dma_map() implies that pending writes are
  222. * flushed to RAM, so no dma_sync is needed here. */
  223. trans_private = rs->rs_transport->get_mr(sg, nents, rs,
  224. &mr->r_key);
  225. if (IS_ERR(trans_private)) {
  226. for (i = 0 ; i < nents; i++)
  227. put_page(sg_page(&sg[i]));
  228. kfree(sg);
  229. ret = PTR_ERR(trans_private);
  230. goto out;
  231. }
  232. mr->r_trans_private = trans_private;
  233. rdsdebug("RDS: get_mr put_user key is %x cookie_addr %p\n",
  234. mr->r_key, (void *)(unsigned long) args->cookie_addr);
  235. /* The user may pass us an unaligned address, but we can only
  236. * map page aligned regions. So we keep the offset, and build
  237. * a 64bit cookie containing <R_Key, offset> and pass that
  238. * around. */
  239. cookie = rds_rdma_make_cookie(mr->r_key, args->vec.addr & ~PAGE_MASK);
  240. if (cookie_ret)
  241. *cookie_ret = cookie;
  242. if (args->cookie_addr && put_user(cookie, (u64 __user *)(unsigned long) args->cookie_addr)) {
  243. ret = -EFAULT;
  244. goto out;
  245. }
  246. /* Inserting the new MR into the rbtree bumps its
  247. * reference count. */
  248. spin_lock_irqsave(&rs->rs_rdma_lock, flags);
  249. found = rds_mr_tree_walk(&rs->rs_rdma_keys, mr->r_key, mr);
  250. spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
  251. BUG_ON(found && found != mr);
  252. rdsdebug("RDS: get_mr key is %x\n", mr->r_key);
  253. if (mr_ret) {
  254. atomic_inc(&mr->r_refcount);
  255. *mr_ret = mr;
  256. }
  257. ret = 0;
  258. out:
  259. kfree(pages);
  260. if (mr)
  261. rds_mr_put(mr);
  262. return ret;
  263. }
  264. int rds_get_mr(struct rds_sock *rs, char __user *optval, int optlen)
  265. {
  266. struct rds_get_mr_args args;
  267. if (optlen != sizeof(struct rds_get_mr_args))
  268. return -EINVAL;
  269. if (copy_from_user(&args, (struct rds_get_mr_args __user *)optval,
  270. sizeof(struct rds_get_mr_args)))
  271. return -EFAULT;
  272. return __rds_rdma_map(rs, &args, NULL, NULL);
  273. }
  274. /*
  275. * Free the MR indicated by the given R_Key
  276. */
  277. int rds_free_mr(struct rds_sock *rs, char __user *optval, int optlen)
  278. {
  279. struct rds_free_mr_args args;
  280. struct rds_mr *mr;
  281. unsigned long flags;
  282. if (optlen != sizeof(struct rds_free_mr_args))
  283. return -EINVAL;
  284. if (copy_from_user(&args, (struct rds_free_mr_args __user *)optval,
  285. sizeof(struct rds_free_mr_args)))
  286. return -EFAULT;
  287. /* Special case - a null cookie means flush all unused MRs */
  288. if (args.cookie == 0) {
  289. if (!rs->rs_transport || !rs->rs_transport->flush_mrs)
  290. return -EINVAL;
  291. rs->rs_transport->flush_mrs();
  292. return 0;
  293. }
  294. /* Look up the MR given its R_key and remove it from the rbtree
  295. * so nobody else finds it.
  296. * This should also prevent races with rds_rdma_unuse.
  297. */
  298. spin_lock_irqsave(&rs->rs_rdma_lock, flags);
  299. mr = rds_mr_tree_walk(&rs->rs_rdma_keys, rds_rdma_cookie_key(args.cookie), NULL);
  300. if (mr) {
  301. rb_erase(&mr->r_rb_node, &rs->rs_rdma_keys);
  302. RB_CLEAR_NODE(&mr->r_rb_node);
  303. if (args.flags & RDS_RDMA_INVALIDATE)
  304. mr->r_invalidate = 1;
  305. }
  306. spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
  307. if (!mr)
  308. return -EINVAL;
  309. /*
  310. * call rds_destroy_mr() ourselves so that we're sure it's done by the time
  311. * we return. If we let rds_mr_put() do it it might not happen until
  312. * someone else drops their ref.
  313. */
  314. rds_destroy_mr(mr);
  315. rds_mr_put(mr);
  316. return 0;
  317. }
  318. /*
  319. * This is called when we receive an extension header that
  320. * tells us this MR was used. It allows us to implement
  321. * use_once semantics
  322. */
  323. void rds_rdma_unuse(struct rds_sock *rs, u32 r_key, int force)
  324. {
  325. struct rds_mr *mr;
  326. unsigned long flags;
  327. int zot_me = 0;
  328. spin_lock_irqsave(&rs->rs_rdma_lock, flags);
  329. mr = rds_mr_tree_walk(&rs->rs_rdma_keys, r_key, NULL);
  330. if (mr && (mr->r_use_once || force)) {
  331. rb_erase(&mr->r_rb_node, &rs->rs_rdma_keys);
  332. RB_CLEAR_NODE(&mr->r_rb_node);
  333. zot_me = 1;
  334. } else if (mr)
  335. atomic_inc(&mr->r_refcount);
  336. spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
  337. /* May have to issue a dma_sync on this memory region.
  338. * Note we could avoid this if the operation was a RDMA READ,
  339. * but at this point we can't tell. */
  340. if (mr != NULL) {
  341. if (mr->r_trans->sync_mr)
  342. mr->r_trans->sync_mr(mr->r_trans_private, DMA_FROM_DEVICE);
  343. /* If the MR was marked as invalidate, this will
  344. * trigger an async flush. */
  345. if (zot_me)
  346. rds_destroy_mr(mr);
  347. rds_mr_put(mr);
  348. }
  349. }
  350. void rds_rdma_free_op(struct rds_rdma_op *ro)
  351. {
  352. unsigned int i;
  353. for (i = 0; i < ro->r_nents; i++) {
  354. struct page *page = sg_page(&ro->r_sg[i]);
  355. /* Mark page dirty if it was possibly modified, which
  356. * is the case for a RDMA_READ which copies from remote
  357. * to local memory */
  358. if (!ro->r_write)
  359. set_page_dirty(page);
  360. put_page(page);
  361. }
  362. kfree(ro->r_notifier);
  363. kfree(ro);
  364. }
  365. /*
  366. * args is a pointer to an in-kernel copy in the sendmsg cmsg.
  367. */
  368. static struct rds_rdma_op *rds_rdma_prepare(struct rds_sock *rs,
  369. struct rds_rdma_args *args)
  370. {
  371. struct rds_iovec vec;
  372. struct rds_rdma_op *op = NULL;
  373. unsigned int nr_pages;
  374. unsigned int max_pages;
  375. unsigned int nr_bytes;
  376. struct page **pages = NULL;
  377. struct rds_iovec __user *local_vec;
  378. struct scatterlist *sg;
  379. unsigned int nr;
  380. unsigned int i, j;
  381. int ret;
  382. if (rs->rs_bound_addr == 0) {
  383. ret = -ENOTCONN; /* XXX not a great errno */
  384. goto out;
  385. }
  386. if (args->nr_local > (u64)UINT_MAX) {
  387. ret = -EMSGSIZE;
  388. goto out;
  389. }
  390. nr_pages = 0;
  391. max_pages = 0;
  392. local_vec = (struct rds_iovec __user *)(unsigned long) args->local_vec_addr;
  393. /* figure out the number of pages in the vector */
  394. for (i = 0; i < args->nr_local; i++) {
  395. if (copy_from_user(&vec, &local_vec[i],
  396. sizeof(struct rds_iovec))) {
  397. ret = -EFAULT;
  398. goto out;
  399. }
  400. nr = rds_pages_in_vec(&vec);
  401. if (nr == 0) {
  402. ret = -EINVAL;
  403. goto out;
  404. }
  405. max_pages = max(nr, max_pages);
  406. nr_pages += nr;
  407. }
  408. pages = kcalloc(max_pages, sizeof(struct page *), GFP_KERNEL);
  409. if (pages == NULL) {
  410. ret = -ENOMEM;
  411. goto out;
  412. }
  413. op = kzalloc(offsetof(struct rds_rdma_op, r_sg[nr_pages]), GFP_KERNEL);
  414. if (op == NULL) {
  415. ret = -ENOMEM;
  416. goto out;
  417. }
  418. op->r_write = !!(args->flags & RDS_RDMA_READWRITE);
  419. op->r_fence = !!(args->flags & RDS_RDMA_FENCE);
  420. op->r_notify = !!(args->flags & RDS_RDMA_NOTIFY_ME);
  421. op->r_recverr = rs->rs_recverr;
  422. WARN_ON(!nr_pages);
  423. sg_init_table(op->r_sg, nr_pages);
  424. if (op->r_notify || op->r_recverr) {
  425. /* We allocate an uninitialized notifier here, because
  426. * we don't want to do that in the completion handler. We
  427. * would have to use GFP_ATOMIC there, and don't want to deal
  428. * with failed allocations.
  429. */
  430. op->r_notifier = kmalloc(sizeof(struct rds_notifier), GFP_KERNEL);
  431. if (!op->r_notifier) {
  432. ret = -ENOMEM;
  433. goto out;
  434. }
  435. op->r_notifier->n_user_token = args->user_token;
  436. op->r_notifier->n_status = RDS_RDMA_SUCCESS;
  437. }
  438. /* The cookie contains the R_Key of the remote memory region, and
  439. * optionally an offset into it. This is how we implement RDMA into
  440. * unaligned memory.
  441. * When setting up the RDMA, we need to add that offset to the
  442. * destination address (which is really an offset into the MR)
  443. * FIXME: We may want to move this into ib_rdma.c
  444. */
  445. op->r_key = rds_rdma_cookie_key(args->cookie);
  446. op->r_remote_addr = args->remote_vec.addr + rds_rdma_cookie_offset(args->cookie);
  447. nr_bytes = 0;
  448. rdsdebug("RDS: rdma prepare nr_local %llu rva %llx rkey %x\n",
  449. (unsigned long long)args->nr_local,
  450. (unsigned long long)args->remote_vec.addr,
  451. op->r_key);
  452. for (i = 0; i < args->nr_local; i++) {
  453. if (copy_from_user(&vec, &local_vec[i],
  454. sizeof(struct rds_iovec))) {
  455. ret = -EFAULT;
  456. goto out;
  457. }
  458. nr = rds_pages_in_vec(&vec);
  459. if (nr == 0) {
  460. ret = -EINVAL;
  461. goto out;
  462. }
  463. rs->rs_user_addr = vec.addr;
  464. rs->rs_user_bytes = vec.bytes;
  465. /* did the user change the vec under us? */
  466. if (nr > max_pages || op->r_nents + nr > nr_pages) {
  467. ret = -EINVAL;
  468. goto out;
  469. }
  470. /* If it's a WRITE operation, we want to pin the pages for reading.
  471. * If it's a READ operation, we need to pin the pages for writing.
  472. */
  473. ret = rds_pin_pages(vec.addr & PAGE_MASK, nr, pages, !op->r_write);
  474. if (ret < 0)
  475. goto out;
  476. rdsdebug("RDS: nr_bytes %u nr %u vec.bytes %llu vec.addr %llx\n",
  477. nr_bytes, nr, vec.bytes, vec.addr);
  478. nr_bytes += vec.bytes;
  479. for (j = 0; j < nr; j++) {
  480. unsigned int offset = vec.addr & ~PAGE_MASK;
  481. sg = &op->r_sg[op->r_nents + j];
  482. sg_set_page(sg, pages[j],
  483. min_t(unsigned int, vec.bytes, PAGE_SIZE - offset),
  484. offset);
  485. rdsdebug("RDS: sg->offset %x sg->len %x vec.addr %llx vec.bytes %llu\n",
  486. sg->offset, sg->length, vec.addr, vec.bytes);
  487. vec.addr += sg->length;
  488. vec.bytes -= sg->length;
  489. }
  490. op->r_nents += nr;
  491. }
  492. if (nr_bytes > args->remote_vec.bytes) {
  493. rdsdebug("RDS nr_bytes %u remote_bytes %u do not match\n",
  494. nr_bytes,
  495. (unsigned int) args->remote_vec.bytes);
  496. ret = -EINVAL;
  497. goto out;
  498. }
  499. op->r_bytes = nr_bytes;
  500. ret = 0;
  501. out:
  502. kfree(pages);
  503. if (ret) {
  504. if (op)
  505. rds_rdma_free_op(op);
  506. op = ERR_PTR(ret);
  507. }
  508. return op;
  509. }
  510. /*
  511. * The application asks for a RDMA transfer.
  512. * Extract all arguments and set up the rdma_op
  513. */
  514. int rds_cmsg_rdma_args(struct rds_sock *rs, struct rds_message *rm,
  515. struct cmsghdr *cmsg)
  516. {
  517. struct rds_rdma_op *op;
  518. if (cmsg->cmsg_len < CMSG_LEN(sizeof(struct rds_rdma_args))
  519. || rm->m_rdma_op != NULL)
  520. return -EINVAL;
  521. op = rds_rdma_prepare(rs, CMSG_DATA(cmsg));
  522. if (IS_ERR(op))
  523. return PTR_ERR(op);
  524. rds_stats_inc(s_send_rdma);
  525. rm->m_rdma_op = op;
  526. return 0;
  527. }
  528. /*
  529. * The application wants us to pass an RDMA destination (aka MR)
  530. * to the remote
  531. */
  532. int rds_cmsg_rdma_dest(struct rds_sock *rs, struct rds_message *rm,
  533. struct cmsghdr *cmsg)
  534. {
  535. unsigned long flags;
  536. struct rds_mr *mr;
  537. u32 r_key;
  538. int err = 0;
  539. if (cmsg->cmsg_len < CMSG_LEN(sizeof(rds_rdma_cookie_t))
  540. || rm->m_rdma_cookie != 0)
  541. return -EINVAL;
  542. memcpy(&rm->m_rdma_cookie, CMSG_DATA(cmsg), sizeof(rm->m_rdma_cookie));
  543. /* We are reusing a previously mapped MR here. Most likely, the
  544. * application has written to the buffer, so we need to explicitly
  545. * flush those writes to RAM. Otherwise the HCA may not see them
  546. * when doing a DMA from that buffer.
  547. */
  548. r_key = rds_rdma_cookie_key(rm->m_rdma_cookie);
  549. spin_lock_irqsave(&rs->rs_rdma_lock, flags);
  550. mr = rds_mr_tree_walk(&rs->rs_rdma_keys, r_key, NULL);
  551. if (mr == NULL)
  552. err = -EINVAL; /* invalid r_key */
  553. else
  554. atomic_inc(&mr->r_refcount);
  555. spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
  556. if (mr) {
  557. mr->r_trans->sync_mr(mr->r_trans_private, DMA_TO_DEVICE);
  558. rm->m_rdma_mr = mr;
  559. }
  560. return err;
  561. }
  562. /*
  563. * The application passes us an address range it wants to enable RDMA
  564. * to/from. We map the area, and save the <R_Key,offset> pair
  565. * in rm->m_rdma_cookie. This causes it to be sent along to the peer
  566. * in an extension header.
  567. */
  568. int rds_cmsg_rdma_map(struct rds_sock *rs, struct rds_message *rm,
  569. struct cmsghdr *cmsg)
  570. {
  571. if (cmsg->cmsg_len < CMSG_LEN(sizeof(struct rds_get_mr_args))
  572. || rm->m_rdma_cookie != 0)
  573. return -EINVAL;
  574. return __rds_rdma_map(rs, CMSG_DATA(cmsg), &rm->m_rdma_cookie, &rm->m_rdma_mr);
  575. }