qib_mr.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503
  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. u8 page_shift;
  40. struct qib_mregion mr; /* must be last */
  41. };
  42. static inline struct qib_fmr *to_ifmr(struct ib_fmr *ibfmr)
  43. {
  44. return container_of(ibfmr, struct qib_fmr, ibfmr);
  45. }
  46. /**
  47. * qib_get_dma_mr - get a DMA memory region
  48. * @pd: protection domain for this memory region
  49. * @acc: access flags
  50. *
  51. * Returns the memory region on success, otherwise returns an errno.
  52. * Note that all DMA addresses should be created via the
  53. * struct ib_dma_mapping_ops functions (see qib_dma.c).
  54. */
  55. struct ib_mr *qib_get_dma_mr(struct ib_pd *pd, int acc)
  56. {
  57. struct qib_ibdev *dev = to_idev(pd->device);
  58. struct qib_mr *mr;
  59. struct ib_mr *ret;
  60. unsigned long flags;
  61. if (to_ipd(pd)->user) {
  62. ret = ERR_PTR(-EPERM);
  63. goto bail;
  64. }
  65. mr = kzalloc(sizeof *mr, GFP_KERNEL);
  66. if (!mr) {
  67. ret = ERR_PTR(-ENOMEM);
  68. goto bail;
  69. }
  70. mr->mr.access_flags = acc;
  71. atomic_set(&mr->mr.refcount, 0);
  72. spin_lock_irqsave(&dev->lk_table.lock, flags);
  73. if (!dev->dma_mr)
  74. dev->dma_mr = &mr->mr;
  75. spin_unlock_irqrestore(&dev->lk_table.lock, flags);
  76. ret = &mr->ibmr;
  77. bail:
  78. return ret;
  79. }
  80. static struct qib_mr *alloc_mr(int count, struct qib_lkey_table *lk_table)
  81. {
  82. struct qib_mr *mr;
  83. int m, i = 0;
  84. /* Allocate struct plus pointers to first level page tables. */
  85. m = (count + QIB_SEGSZ - 1) / QIB_SEGSZ;
  86. mr = kmalloc(sizeof *mr + m * sizeof mr->mr.map[0], GFP_KERNEL);
  87. if (!mr)
  88. goto done;
  89. /* Allocate first level page tables. */
  90. for (; i < m; i++) {
  91. mr->mr.map[i] = kmalloc(sizeof *mr->mr.map[0], GFP_KERNEL);
  92. if (!mr->mr.map[i])
  93. goto bail;
  94. }
  95. mr->mr.mapsz = m;
  96. mr->mr.max_segs = count;
  97. /*
  98. * ib_reg_phys_mr() will initialize mr->ibmr except for
  99. * lkey and rkey.
  100. */
  101. if (!qib_alloc_lkey(lk_table, &mr->mr))
  102. goto bail;
  103. mr->ibmr.lkey = mr->mr.lkey;
  104. mr->ibmr.rkey = mr->mr.lkey;
  105. atomic_set(&mr->mr.refcount, 0);
  106. goto done;
  107. bail:
  108. while (i)
  109. kfree(mr->mr.map[--i]);
  110. kfree(mr);
  111. mr = NULL;
  112. done:
  113. return mr;
  114. }
  115. /**
  116. * qib_reg_phys_mr - register a physical memory region
  117. * @pd: protection domain for this memory region
  118. * @buffer_list: pointer to the list of physical buffers to register
  119. * @num_phys_buf: the number of physical buffers to register
  120. * @iova_start: the starting address passed over IB which maps to this MR
  121. *
  122. * Returns the memory region on success, otherwise returns an errno.
  123. */
  124. struct ib_mr *qib_reg_phys_mr(struct ib_pd *pd,
  125. struct ib_phys_buf *buffer_list,
  126. int num_phys_buf, int acc, u64 *iova_start)
  127. {
  128. struct qib_mr *mr;
  129. int n, m, i;
  130. struct ib_mr *ret;
  131. mr = alloc_mr(num_phys_buf, &to_idev(pd->device)->lk_table);
  132. if (mr == NULL) {
  133. ret = ERR_PTR(-ENOMEM);
  134. goto bail;
  135. }
  136. mr->mr.pd = pd;
  137. mr->mr.user_base = *iova_start;
  138. mr->mr.iova = *iova_start;
  139. mr->mr.length = 0;
  140. mr->mr.offset = 0;
  141. mr->mr.access_flags = acc;
  142. mr->umem = NULL;
  143. m = 0;
  144. n = 0;
  145. for (i = 0; i < num_phys_buf; i++) {
  146. mr->mr.map[m]->segs[n].vaddr = (void *) buffer_list[i].addr;
  147. mr->mr.map[m]->segs[n].length = buffer_list[i].size;
  148. mr->mr.length += buffer_list[i].size;
  149. n++;
  150. if (n == QIB_SEGSZ) {
  151. m++;
  152. n = 0;
  153. }
  154. }
  155. ret = &mr->ibmr;
  156. bail:
  157. return ret;
  158. }
  159. /**
  160. * qib_reg_user_mr - register a userspace memory region
  161. * @pd: protection domain for this memory region
  162. * @start: starting userspace address
  163. * @length: length of region to register
  164. * @virt_addr: virtual address to use (from HCA's point of view)
  165. * @mr_access_flags: access flags for this memory region
  166. * @udata: unused by the QLogic_IB driver
  167. *
  168. * Returns the memory region on success, otherwise returns an errno.
  169. */
  170. struct ib_mr *qib_reg_user_mr(struct ib_pd *pd, u64 start, u64 length,
  171. u64 virt_addr, int mr_access_flags,
  172. struct ib_udata *udata)
  173. {
  174. struct qib_mr *mr;
  175. struct ib_umem *umem;
  176. struct ib_umem_chunk *chunk;
  177. int n, m, i;
  178. struct ib_mr *ret;
  179. if (length == 0) {
  180. ret = ERR_PTR(-EINVAL);
  181. goto bail;
  182. }
  183. umem = ib_umem_get(pd->uobject->context, start, length,
  184. mr_access_flags, 0);
  185. if (IS_ERR(umem))
  186. return (void *) umem;
  187. n = 0;
  188. list_for_each_entry(chunk, &umem->chunk_list, list)
  189. n += chunk->nents;
  190. mr = alloc_mr(n, &to_idev(pd->device)->lk_table);
  191. if (!mr) {
  192. ret = ERR_PTR(-ENOMEM);
  193. ib_umem_release(umem);
  194. goto bail;
  195. }
  196. mr->mr.pd = pd;
  197. mr->mr.user_base = start;
  198. mr->mr.iova = virt_addr;
  199. mr->mr.length = length;
  200. mr->mr.offset = umem->offset;
  201. mr->mr.access_flags = mr_access_flags;
  202. mr->umem = umem;
  203. m = 0;
  204. n = 0;
  205. list_for_each_entry(chunk, &umem->chunk_list, list) {
  206. for (i = 0; i < chunk->nents; i++) {
  207. void *vaddr;
  208. vaddr = page_address(sg_page(&chunk->page_list[i]));
  209. if (!vaddr) {
  210. ret = ERR_PTR(-EINVAL);
  211. goto bail;
  212. }
  213. mr->mr.map[m]->segs[n].vaddr = vaddr;
  214. mr->mr.map[m]->segs[n].length = umem->page_size;
  215. n++;
  216. if (n == QIB_SEGSZ) {
  217. m++;
  218. n = 0;
  219. }
  220. }
  221. }
  222. ret = &mr->ibmr;
  223. bail:
  224. return ret;
  225. }
  226. /**
  227. * qib_dereg_mr - unregister and free a memory region
  228. * @ibmr: the memory region to free
  229. *
  230. * Returns 0 on success.
  231. *
  232. * Note that this is called to free MRs created by qib_get_dma_mr()
  233. * or qib_reg_user_mr().
  234. */
  235. int qib_dereg_mr(struct ib_mr *ibmr)
  236. {
  237. struct qib_mr *mr = to_imr(ibmr);
  238. struct qib_ibdev *dev = to_idev(ibmr->device);
  239. int ret;
  240. int i;
  241. ret = qib_free_lkey(dev, &mr->mr);
  242. if (ret)
  243. return ret;
  244. i = mr->mr.mapsz;
  245. while (i)
  246. kfree(mr->mr.map[--i]);
  247. if (mr->umem)
  248. ib_umem_release(mr->umem);
  249. kfree(mr);
  250. return 0;
  251. }
  252. /*
  253. * Allocate a memory region usable with the
  254. * IB_WR_FAST_REG_MR send work request.
  255. *
  256. * Return the memory region on success, otherwise return an errno.
  257. */
  258. struct ib_mr *qib_alloc_fast_reg_mr(struct ib_pd *pd, int max_page_list_len)
  259. {
  260. struct qib_mr *mr;
  261. mr = alloc_mr(max_page_list_len, &to_idev(pd->device)->lk_table);
  262. if (mr == NULL)
  263. return ERR_PTR(-ENOMEM);
  264. mr->mr.pd = pd;
  265. mr->mr.user_base = 0;
  266. mr->mr.iova = 0;
  267. mr->mr.length = 0;
  268. mr->mr.offset = 0;
  269. mr->mr.access_flags = 0;
  270. mr->umem = NULL;
  271. return &mr->ibmr;
  272. }
  273. struct ib_fast_reg_page_list *
  274. qib_alloc_fast_reg_page_list(struct ib_device *ibdev, int page_list_len)
  275. {
  276. unsigned size = page_list_len * sizeof(u64);
  277. struct ib_fast_reg_page_list *pl;
  278. if (size > PAGE_SIZE)
  279. return ERR_PTR(-EINVAL);
  280. pl = kmalloc(sizeof *pl, GFP_KERNEL);
  281. if (!pl)
  282. return ERR_PTR(-ENOMEM);
  283. pl->page_list = kmalloc(size, GFP_KERNEL);
  284. if (!pl->page_list)
  285. goto err_free;
  286. return pl;
  287. err_free:
  288. kfree(pl);
  289. return ERR_PTR(-ENOMEM);
  290. }
  291. void qib_free_fast_reg_page_list(struct ib_fast_reg_page_list *pl)
  292. {
  293. kfree(pl->page_list);
  294. kfree(pl);
  295. }
  296. /**
  297. * qib_alloc_fmr - allocate a fast memory region
  298. * @pd: the protection domain for this memory region
  299. * @mr_access_flags: access flags for this memory region
  300. * @fmr_attr: fast memory region attributes
  301. *
  302. * Returns the memory region on success, otherwise returns an errno.
  303. */
  304. struct ib_fmr *qib_alloc_fmr(struct ib_pd *pd, int mr_access_flags,
  305. struct ib_fmr_attr *fmr_attr)
  306. {
  307. struct qib_fmr *fmr;
  308. int m, i = 0;
  309. struct ib_fmr *ret;
  310. /* Allocate struct plus pointers to first level page tables. */
  311. m = (fmr_attr->max_pages + QIB_SEGSZ - 1) / QIB_SEGSZ;
  312. fmr = kmalloc(sizeof *fmr + m * sizeof fmr->mr.map[0], GFP_KERNEL);
  313. if (!fmr)
  314. goto bail;
  315. /* Allocate first level page tables. */
  316. for (; i < m; i++) {
  317. fmr->mr.map[i] = kmalloc(sizeof *fmr->mr.map[0],
  318. GFP_KERNEL);
  319. if (!fmr->mr.map[i])
  320. goto bail;
  321. }
  322. fmr->mr.mapsz = m;
  323. /*
  324. * ib_alloc_fmr() will initialize fmr->ibfmr except for lkey &
  325. * rkey.
  326. */
  327. if (!qib_alloc_lkey(&to_idev(pd->device)->lk_table, &fmr->mr))
  328. goto bail;
  329. fmr->ibfmr.rkey = fmr->mr.lkey;
  330. fmr->ibfmr.lkey = fmr->mr.lkey;
  331. /*
  332. * Resources are allocated but no valid mapping (RKEY can't be
  333. * used).
  334. */
  335. fmr->mr.pd = pd;
  336. fmr->mr.user_base = 0;
  337. fmr->mr.iova = 0;
  338. fmr->mr.length = 0;
  339. fmr->mr.offset = 0;
  340. fmr->mr.access_flags = mr_access_flags;
  341. fmr->mr.max_segs = fmr_attr->max_pages;
  342. fmr->page_shift = fmr_attr->page_shift;
  343. atomic_set(&fmr->mr.refcount, 0);
  344. ret = &fmr->ibfmr;
  345. goto done;
  346. bail:
  347. while (i)
  348. kfree(fmr->mr.map[--i]);
  349. kfree(fmr);
  350. ret = ERR_PTR(-ENOMEM);
  351. done:
  352. return ret;
  353. }
  354. /**
  355. * qib_map_phys_fmr - set up a fast memory region
  356. * @ibmfr: the fast memory region to set up
  357. * @page_list: the list of pages to associate with the fast memory region
  358. * @list_len: the number of pages to associate with the fast memory region
  359. * @iova: the virtual address of the start of the fast memory region
  360. *
  361. * This may be called from interrupt context.
  362. */
  363. int qib_map_phys_fmr(struct ib_fmr *ibfmr, u64 *page_list,
  364. int list_len, u64 iova)
  365. {
  366. struct qib_fmr *fmr = to_ifmr(ibfmr);
  367. struct qib_lkey_table *rkt;
  368. unsigned long flags;
  369. int m, n, i;
  370. u32 ps;
  371. int ret;
  372. if (atomic_read(&fmr->mr.refcount))
  373. return -EBUSY;
  374. if (list_len > fmr->mr.max_segs) {
  375. ret = -EINVAL;
  376. goto bail;
  377. }
  378. rkt = &to_idev(ibfmr->device)->lk_table;
  379. spin_lock_irqsave(&rkt->lock, flags);
  380. fmr->mr.user_base = iova;
  381. fmr->mr.iova = iova;
  382. ps = 1 << fmr->page_shift;
  383. fmr->mr.length = list_len * ps;
  384. m = 0;
  385. n = 0;
  386. for (i = 0; i < list_len; i++) {
  387. fmr->mr.map[m]->segs[n].vaddr = (void *) page_list[i];
  388. fmr->mr.map[m]->segs[n].length = ps;
  389. if (++n == QIB_SEGSZ) {
  390. m++;
  391. n = 0;
  392. }
  393. }
  394. spin_unlock_irqrestore(&rkt->lock, flags);
  395. ret = 0;
  396. bail:
  397. return ret;
  398. }
  399. /**
  400. * qib_unmap_fmr - unmap fast memory regions
  401. * @fmr_list: the list of fast memory regions to unmap
  402. *
  403. * Returns 0 on success.
  404. */
  405. int qib_unmap_fmr(struct list_head *fmr_list)
  406. {
  407. struct qib_fmr *fmr;
  408. struct qib_lkey_table *rkt;
  409. unsigned long flags;
  410. list_for_each_entry(fmr, fmr_list, ibfmr.list) {
  411. rkt = &to_idev(fmr->ibfmr.device)->lk_table;
  412. spin_lock_irqsave(&rkt->lock, flags);
  413. fmr->mr.user_base = 0;
  414. fmr->mr.iova = 0;
  415. fmr->mr.length = 0;
  416. spin_unlock_irqrestore(&rkt->lock, flags);
  417. }
  418. return 0;
  419. }
  420. /**
  421. * qib_dealloc_fmr - deallocate a fast memory region
  422. * @ibfmr: the fast memory region to deallocate
  423. *
  424. * Returns 0 on success.
  425. */
  426. int qib_dealloc_fmr(struct ib_fmr *ibfmr)
  427. {
  428. struct qib_fmr *fmr = to_ifmr(ibfmr);
  429. int ret;
  430. int i;
  431. ret = qib_free_lkey(to_idev(ibfmr->device), &fmr->mr);
  432. if (ret)
  433. return ret;
  434. i = fmr->mr.mapsz;
  435. while (i)
  436. kfree(fmr->mr.map[--i]);
  437. kfree(fmr);
  438. return 0;
  439. }