qib_mr.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490
  1. /*
  2. * Copyright (c) 2006, 2007, 2008, 2009 QLogic Corporation. All rights reserved.
  3. * Copyright (c) 2005, 2006 PathScale, 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
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <rdma/ib_umem.h>
  34. #include <rdma/ib_smi.h>
  35. #include "qib.h"
  36. /* Fast memory region */
  37. struct qib_fmr {
  38. struct ib_fmr ibfmr;
  39. struct qib_mregion mr; /* must be last */
  40. };
  41. static inline struct qib_fmr *to_ifmr(struct ib_fmr *ibfmr)
  42. {
  43. return container_of(ibfmr, struct qib_fmr, ibfmr);
  44. }
  45. static int init_qib_mregion(struct qib_mregion *mr, struct ib_pd *pd,
  46. int count)
  47. {
  48. int m, i = 0;
  49. int rval = 0;
  50. m = (count + QIB_SEGSZ - 1) / QIB_SEGSZ;
  51. for (; i < m; i++) {
  52. mr->map[i] = kzalloc(sizeof(*mr->map[0]), GFP_KERNEL);
  53. if (!mr->map[i])
  54. goto bail;
  55. }
  56. mr->mapsz = m;
  57. init_completion(&mr->comp);
  58. /* count returning the ptr to user */
  59. atomic_set(&mr->refcount, 1);
  60. mr->pd = pd;
  61. mr->max_segs = count;
  62. out:
  63. return rval;
  64. bail:
  65. while (i)
  66. kfree(mr->map[--i]);
  67. rval = -ENOMEM;
  68. goto out;
  69. }
  70. static void deinit_qib_mregion(struct qib_mregion *mr)
  71. {
  72. int i = mr->mapsz;
  73. mr->mapsz = 0;
  74. while (i)
  75. kfree(mr->map[--i]);
  76. }
  77. /**
  78. * qib_get_dma_mr - get a DMA memory region
  79. * @pd: protection domain for this memory region
  80. * @acc: access flags
  81. *
  82. * Returns the memory region on success, otherwise returns an errno.
  83. * Note that all DMA addresses should be created via the
  84. * struct ib_dma_mapping_ops functions (see qib_dma.c).
  85. */
  86. struct ib_mr *qib_get_dma_mr(struct ib_pd *pd, int acc)
  87. {
  88. struct qib_mr *mr = NULL;
  89. struct ib_mr *ret;
  90. int rval;
  91. if (to_ipd(pd)->user) {
  92. ret = ERR_PTR(-EPERM);
  93. goto bail;
  94. }
  95. mr = kzalloc(sizeof(*mr), GFP_KERNEL);
  96. if (!mr) {
  97. ret = ERR_PTR(-ENOMEM);
  98. goto bail;
  99. }
  100. rval = init_qib_mregion(&mr->mr, pd, 0);
  101. if (rval) {
  102. ret = ERR_PTR(rval);
  103. goto bail;
  104. }
  105. rval = qib_alloc_lkey(&mr->mr, 1);
  106. if (rval) {
  107. ret = ERR_PTR(rval);
  108. goto bail_mregion;
  109. }
  110. mr->mr.access_flags = acc;
  111. ret = &mr->ibmr;
  112. done:
  113. return ret;
  114. bail_mregion:
  115. deinit_qib_mregion(&mr->mr);
  116. bail:
  117. kfree(mr);
  118. goto done;
  119. }
  120. static struct qib_mr *alloc_mr(int count, struct ib_pd *pd)
  121. {
  122. struct qib_mr *mr;
  123. int rval = -ENOMEM;
  124. int m;
  125. /* Allocate struct plus pointers to first level page tables. */
  126. m = (count + QIB_SEGSZ - 1) / QIB_SEGSZ;
  127. mr = kzalloc(sizeof(*mr) + m * sizeof(mr->mr.map[0]), GFP_KERNEL);
  128. if (!mr)
  129. goto bail;
  130. rval = init_qib_mregion(&mr->mr, pd, count);
  131. if (rval)
  132. goto bail;
  133. rval = qib_alloc_lkey(&mr->mr, 0);
  134. if (rval)
  135. goto bail_mregion;
  136. mr->ibmr.lkey = mr->mr.lkey;
  137. mr->ibmr.rkey = mr->mr.lkey;
  138. done:
  139. return mr;
  140. bail_mregion:
  141. deinit_qib_mregion(&mr->mr);
  142. bail:
  143. kfree(mr);
  144. mr = ERR_PTR(rval);
  145. goto done;
  146. }
  147. /**
  148. * qib_reg_user_mr - register a userspace memory region
  149. * @pd: protection domain for this memory region
  150. * @start: starting userspace address
  151. * @length: length of region to register
  152. * @mr_access_flags: access flags for this memory region
  153. * @udata: unused by the QLogic_IB driver
  154. *
  155. * Returns the memory region on success, otherwise returns an errno.
  156. */
  157. struct ib_mr *qib_reg_user_mr(struct ib_pd *pd, u64 start, u64 length,
  158. u64 virt_addr, int mr_access_flags,
  159. struct ib_udata *udata)
  160. {
  161. struct qib_mr *mr;
  162. struct ib_umem *umem;
  163. struct scatterlist *sg;
  164. int n, m, entry;
  165. struct ib_mr *ret;
  166. if (length == 0) {
  167. ret = ERR_PTR(-EINVAL);
  168. goto bail;
  169. }
  170. umem = ib_umem_get(pd->uobject->context, start, length,
  171. mr_access_flags, 0);
  172. if (IS_ERR(umem))
  173. return (void *) umem;
  174. n = umem->nmap;
  175. mr = alloc_mr(n, pd);
  176. if (IS_ERR(mr)) {
  177. ret = (struct ib_mr *)mr;
  178. ib_umem_release(umem);
  179. goto bail;
  180. }
  181. mr->mr.user_base = start;
  182. mr->mr.iova = virt_addr;
  183. mr->mr.length = length;
  184. mr->mr.offset = ib_umem_offset(umem);
  185. mr->mr.access_flags = mr_access_flags;
  186. mr->umem = umem;
  187. if (is_power_of_2(umem->page_size))
  188. mr->mr.page_shift = ilog2(umem->page_size);
  189. m = 0;
  190. n = 0;
  191. for_each_sg(umem->sg_head.sgl, sg, umem->nmap, entry) {
  192. void *vaddr;
  193. vaddr = page_address(sg_page(sg));
  194. if (!vaddr) {
  195. ret = ERR_PTR(-EINVAL);
  196. goto bail;
  197. }
  198. mr->mr.map[m]->segs[n].vaddr = vaddr;
  199. mr->mr.map[m]->segs[n].length = umem->page_size;
  200. n++;
  201. if (n == QIB_SEGSZ) {
  202. m++;
  203. n = 0;
  204. }
  205. }
  206. ret = &mr->ibmr;
  207. bail:
  208. return ret;
  209. }
  210. /**
  211. * qib_dereg_mr - unregister and free a memory region
  212. * @ibmr: the memory region to free
  213. *
  214. * Returns 0 on success.
  215. *
  216. * Note that this is called to free MRs created by qib_get_dma_mr()
  217. * or qib_reg_user_mr().
  218. */
  219. int qib_dereg_mr(struct ib_mr *ibmr)
  220. {
  221. struct qib_mr *mr = to_imr(ibmr);
  222. int ret = 0;
  223. unsigned long timeout;
  224. kfree(mr->pages);
  225. qib_free_lkey(&mr->mr);
  226. qib_put_mr(&mr->mr); /* will set completion if last */
  227. timeout = wait_for_completion_timeout(&mr->mr.comp,
  228. 5 * HZ);
  229. if (!timeout) {
  230. qib_get_mr(&mr->mr);
  231. ret = -EBUSY;
  232. goto out;
  233. }
  234. deinit_qib_mregion(&mr->mr);
  235. if (mr->umem)
  236. ib_umem_release(mr->umem);
  237. kfree(mr);
  238. out:
  239. return ret;
  240. }
  241. /*
  242. * Allocate a memory region usable with the
  243. * IB_WR_REG_MR send work request.
  244. *
  245. * Return the memory region on success, otherwise return an errno.
  246. */
  247. struct ib_mr *qib_alloc_mr(struct ib_pd *pd,
  248. enum ib_mr_type mr_type,
  249. u32 max_num_sg)
  250. {
  251. struct qib_mr *mr;
  252. if (mr_type != IB_MR_TYPE_MEM_REG)
  253. return ERR_PTR(-EINVAL);
  254. mr = alloc_mr(max_num_sg, pd);
  255. if (IS_ERR(mr))
  256. return (struct ib_mr *)mr;
  257. mr->pages = kcalloc(max_num_sg, sizeof(u64), GFP_KERNEL);
  258. if (!mr->pages)
  259. goto err;
  260. return &mr->ibmr;
  261. err:
  262. qib_dereg_mr(&mr->ibmr);
  263. return ERR_PTR(-ENOMEM);
  264. }
  265. static int qib_set_page(struct ib_mr *ibmr, u64 addr)
  266. {
  267. struct qib_mr *mr = to_imr(ibmr);
  268. if (unlikely(mr->npages == mr->mr.max_segs))
  269. return -ENOMEM;
  270. mr->pages[mr->npages++] = addr;
  271. return 0;
  272. }
  273. int qib_map_mr_sg(struct ib_mr *ibmr,
  274. struct scatterlist *sg,
  275. int sg_nents)
  276. {
  277. struct qib_mr *mr = to_imr(ibmr);
  278. mr->npages = 0;
  279. return ib_sg_to_pages(ibmr, sg, sg_nents, qib_set_page);
  280. }
  281. /**
  282. * qib_alloc_fmr - allocate a fast memory region
  283. * @pd: the protection domain for this memory region
  284. * @mr_access_flags: access flags for this memory region
  285. * @fmr_attr: fast memory region attributes
  286. *
  287. * Returns the memory region on success, otherwise returns an errno.
  288. */
  289. struct ib_fmr *qib_alloc_fmr(struct ib_pd *pd, int mr_access_flags,
  290. struct ib_fmr_attr *fmr_attr)
  291. {
  292. struct qib_fmr *fmr;
  293. int m;
  294. struct ib_fmr *ret;
  295. int rval = -ENOMEM;
  296. /* Allocate struct plus pointers to first level page tables. */
  297. m = (fmr_attr->max_pages + QIB_SEGSZ - 1) / QIB_SEGSZ;
  298. fmr = kzalloc(sizeof(*fmr) + m * sizeof(fmr->mr.map[0]), GFP_KERNEL);
  299. if (!fmr)
  300. goto bail;
  301. rval = init_qib_mregion(&fmr->mr, pd, fmr_attr->max_pages);
  302. if (rval)
  303. goto bail;
  304. /*
  305. * ib_alloc_fmr() will initialize fmr->ibfmr except for lkey &
  306. * rkey.
  307. */
  308. rval = qib_alloc_lkey(&fmr->mr, 0);
  309. if (rval)
  310. goto bail_mregion;
  311. fmr->ibfmr.rkey = fmr->mr.lkey;
  312. fmr->ibfmr.lkey = fmr->mr.lkey;
  313. /*
  314. * Resources are allocated but no valid mapping (RKEY can't be
  315. * used).
  316. */
  317. fmr->mr.access_flags = mr_access_flags;
  318. fmr->mr.max_segs = fmr_attr->max_pages;
  319. fmr->mr.page_shift = fmr_attr->page_shift;
  320. ret = &fmr->ibfmr;
  321. done:
  322. return ret;
  323. bail_mregion:
  324. deinit_qib_mregion(&fmr->mr);
  325. bail:
  326. kfree(fmr);
  327. ret = ERR_PTR(rval);
  328. goto done;
  329. }
  330. /**
  331. * qib_map_phys_fmr - set up a fast memory region
  332. * @ibmfr: the fast memory region to set up
  333. * @page_list: the list of pages to associate with the fast memory region
  334. * @list_len: the number of pages to associate with the fast memory region
  335. * @iova: the virtual address of the start of the fast memory region
  336. *
  337. * This may be called from interrupt context.
  338. */
  339. int qib_map_phys_fmr(struct ib_fmr *ibfmr, u64 *page_list,
  340. int list_len, u64 iova)
  341. {
  342. struct qib_fmr *fmr = to_ifmr(ibfmr);
  343. struct qib_lkey_table *rkt;
  344. unsigned long flags;
  345. int m, n, i;
  346. u32 ps;
  347. int ret;
  348. i = atomic_read(&fmr->mr.refcount);
  349. if (i > 2)
  350. return -EBUSY;
  351. if (list_len > fmr->mr.max_segs) {
  352. ret = -EINVAL;
  353. goto bail;
  354. }
  355. rkt = &to_idev(ibfmr->device)->lk_table;
  356. spin_lock_irqsave(&rkt->lock, flags);
  357. fmr->mr.user_base = iova;
  358. fmr->mr.iova = iova;
  359. ps = 1 << fmr->mr.page_shift;
  360. fmr->mr.length = list_len * ps;
  361. m = 0;
  362. n = 0;
  363. for (i = 0; i < list_len; i++) {
  364. fmr->mr.map[m]->segs[n].vaddr = (void *) page_list[i];
  365. fmr->mr.map[m]->segs[n].length = ps;
  366. if (++n == QIB_SEGSZ) {
  367. m++;
  368. n = 0;
  369. }
  370. }
  371. spin_unlock_irqrestore(&rkt->lock, flags);
  372. ret = 0;
  373. bail:
  374. return ret;
  375. }
  376. /**
  377. * qib_unmap_fmr - unmap fast memory regions
  378. * @fmr_list: the list of fast memory regions to unmap
  379. *
  380. * Returns 0 on success.
  381. */
  382. int qib_unmap_fmr(struct list_head *fmr_list)
  383. {
  384. struct qib_fmr *fmr;
  385. struct qib_lkey_table *rkt;
  386. unsigned long flags;
  387. list_for_each_entry(fmr, fmr_list, ibfmr.list) {
  388. rkt = &to_idev(fmr->ibfmr.device)->lk_table;
  389. spin_lock_irqsave(&rkt->lock, flags);
  390. fmr->mr.user_base = 0;
  391. fmr->mr.iova = 0;
  392. fmr->mr.length = 0;
  393. spin_unlock_irqrestore(&rkt->lock, flags);
  394. }
  395. return 0;
  396. }
  397. /**
  398. * qib_dealloc_fmr - deallocate a fast memory region
  399. * @ibfmr: the fast memory region to deallocate
  400. *
  401. * Returns 0 on success.
  402. */
  403. int qib_dealloc_fmr(struct ib_fmr *ibfmr)
  404. {
  405. struct qib_fmr *fmr = to_ifmr(ibfmr);
  406. int ret = 0;
  407. unsigned long timeout;
  408. qib_free_lkey(&fmr->mr);
  409. qib_put_mr(&fmr->mr); /* will set completion if last */
  410. timeout = wait_for_completion_timeout(&fmr->mr.comp,
  411. 5 * HZ);
  412. if (!timeout) {
  413. qib_get_mr(&fmr->mr);
  414. ret = -EBUSY;
  415. goto out;
  416. }
  417. deinit_qib_mregion(&fmr->mr);
  418. kfree(fmr);
  419. out:
  420. return ret;
  421. }
  422. void mr_rcu_callback(struct rcu_head *list)
  423. {
  424. struct qib_mregion *mr = container_of(list, struct qib_mregion, list);
  425. complete(&mr->comp);
  426. }