umem.c 7.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295
  1. /*
  2. * Copyright (c) 2005 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Cisco Systems. All rights reserved.
  4. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  5. *
  6. * This software is available to you under a choice of one of two
  7. * licenses. You may choose to be licensed under the terms of the GNU
  8. * General Public License (GPL) Version 2, available from the file
  9. * COPYING in the main directory of this source tree, or the
  10. * OpenIB.org BSD license below:
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above
  17. * copyright notice, this list of conditions and the following
  18. * disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials
  23. * provided with the distribution.
  24. *
  25. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  26. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  27. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  28. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  29. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  30. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  31. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  32. * SOFTWARE.
  33. */
  34. #include <linux/mm.h>
  35. #include <linux/dma-mapping.h>
  36. #include <linux/sched.h>
  37. #include <linux/export.h>
  38. #include <linux/hugetlb.h>
  39. #include <linux/dma-attrs.h>
  40. #include <linux/slab.h>
  41. #include "uverbs.h"
  42. #define IB_UMEM_MAX_PAGE_CHUNK \
  43. ((PAGE_SIZE - offsetof(struct ib_umem_chunk, page_list)) / \
  44. ((void *) &((struct ib_umem_chunk *) 0)->page_list[1] - \
  45. (void *) &((struct ib_umem_chunk *) 0)->page_list[0]))
  46. static void __ib_umem_release(struct ib_device *dev, struct ib_umem *umem, int dirty)
  47. {
  48. struct ib_umem_chunk *chunk, *tmp;
  49. int i;
  50. list_for_each_entry_safe(chunk, tmp, &umem->chunk_list, list) {
  51. ib_dma_unmap_sg(dev, chunk->page_list,
  52. chunk->nents, DMA_BIDIRECTIONAL);
  53. for (i = 0; i < chunk->nents; ++i) {
  54. struct page *page = sg_page(&chunk->page_list[i]);
  55. if (umem->writable && dirty)
  56. set_page_dirty_lock(page);
  57. put_page(page);
  58. }
  59. kfree(chunk);
  60. }
  61. }
  62. /**
  63. * ib_umem_get - Pin and DMA map userspace memory.
  64. * @context: userspace context to pin memory for
  65. * @addr: userspace virtual address to start at
  66. * @size: length of region to pin
  67. * @access: IB_ACCESS_xxx flags for memory being pinned
  68. * @dmasync: flush in-flight DMA when the memory region is written
  69. */
  70. struct ib_umem *ib_umem_get(struct ib_ucontext *context, unsigned long addr,
  71. size_t size, int access, int dmasync)
  72. {
  73. struct ib_umem *umem;
  74. struct page **page_list;
  75. struct vm_area_struct **vma_list;
  76. struct ib_umem_chunk *chunk;
  77. unsigned long locked;
  78. unsigned long lock_limit;
  79. unsigned long cur_base;
  80. unsigned long npages;
  81. int ret;
  82. int off;
  83. int i;
  84. DEFINE_DMA_ATTRS(attrs);
  85. if (dmasync)
  86. dma_set_attr(DMA_ATTR_WRITE_BARRIER, &attrs);
  87. if (!can_do_mlock())
  88. return ERR_PTR(-EPERM);
  89. umem = kmalloc(sizeof *umem, GFP_KERNEL);
  90. if (!umem)
  91. return ERR_PTR(-ENOMEM);
  92. umem->context = context;
  93. umem->length = size;
  94. umem->offset = addr & ~PAGE_MASK;
  95. umem->page_size = PAGE_SIZE;
  96. /*
  97. * We ask for writable memory if any access flags other than
  98. * "remote read" are set. "Local write" and "remote write"
  99. * obviously require write access. "Remote atomic" can do
  100. * things like fetch and add, which will modify memory, and
  101. * "MW bind" can change permissions by binding a window.
  102. */
  103. umem->writable = !!(access & ~IB_ACCESS_REMOTE_READ);
  104. /* We assume the memory is from hugetlb until proved otherwise */
  105. umem->hugetlb = 1;
  106. INIT_LIST_HEAD(&umem->chunk_list);
  107. page_list = (struct page **) __get_free_page(GFP_KERNEL);
  108. if (!page_list) {
  109. kfree(umem);
  110. return ERR_PTR(-ENOMEM);
  111. }
  112. /*
  113. * if we can't alloc the vma_list, it's not so bad;
  114. * just assume the memory is not hugetlb memory
  115. */
  116. vma_list = (struct vm_area_struct **) __get_free_page(GFP_KERNEL);
  117. if (!vma_list)
  118. umem->hugetlb = 0;
  119. npages = PAGE_ALIGN(size + umem->offset) >> PAGE_SHIFT;
  120. down_write(&current->mm->mmap_sem);
  121. locked = npages + current->mm->pinned_vm;
  122. lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  123. if ((locked > lock_limit) && !capable(CAP_IPC_LOCK)) {
  124. ret = -ENOMEM;
  125. goto out;
  126. }
  127. cur_base = addr & PAGE_MASK;
  128. ret = 0;
  129. while (npages) {
  130. ret = get_user_pages(current, current->mm, cur_base,
  131. min_t(unsigned long, npages,
  132. PAGE_SIZE / sizeof (struct page *)),
  133. 1, !umem->writable, page_list, vma_list);
  134. if (ret < 0)
  135. goto out;
  136. cur_base += ret * PAGE_SIZE;
  137. npages -= ret;
  138. off = 0;
  139. while (ret) {
  140. chunk = kmalloc(sizeof *chunk + sizeof (struct scatterlist) *
  141. min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK),
  142. GFP_KERNEL);
  143. if (!chunk) {
  144. ret = -ENOMEM;
  145. goto out;
  146. }
  147. chunk->nents = min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK);
  148. sg_init_table(chunk->page_list, chunk->nents);
  149. for (i = 0; i < chunk->nents; ++i) {
  150. if (vma_list &&
  151. !is_vm_hugetlb_page(vma_list[i + off]))
  152. umem->hugetlb = 0;
  153. sg_set_page(&chunk->page_list[i], page_list[i + off], PAGE_SIZE, 0);
  154. }
  155. chunk->nmap = ib_dma_map_sg_attrs(context->device,
  156. &chunk->page_list[0],
  157. chunk->nents,
  158. DMA_BIDIRECTIONAL,
  159. &attrs);
  160. if (chunk->nmap <= 0) {
  161. for (i = 0; i < chunk->nents; ++i)
  162. put_page(sg_page(&chunk->page_list[i]));
  163. kfree(chunk);
  164. ret = -ENOMEM;
  165. goto out;
  166. }
  167. ret -= chunk->nents;
  168. off += chunk->nents;
  169. list_add_tail(&chunk->list, &umem->chunk_list);
  170. }
  171. ret = 0;
  172. }
  173. out:
  174. if (ret < 0) {
  175. __ib_umem_release(context->device, umem, 0);
  176. kfree(umem);
  177. } else
  178. current->mm->pinned_vm = locked;
  179. up_write(&current->mm->mmap_sem);
  180. if (vma_list)
  181. free_page((unsigned long) vma_list);
  182. free_page((unsigned long) page_list);
  183. return ret < 0 ? ERR_PTR(ret) : umem;
  184. }
  185. EXPORT_SYMBOL(ib_umem_get);
  186. static void ib_umem_account(struct work_struct *work)
  187. {
  188. struct ib_umem *umem = container_of(work, struct ib_umem, work);
  189. down_write(&umem->mm->mmap_sem);
  190. umem->mm->pinned_vm -= umem->diff;
  191. up_write(&umem->mm->mmap_sem);
  192. mmput(umem->mm);
  193. kfree(umem);
  194. }
  195. /**
  196. * ib_umem_release - release memory pinned with ib_umem_get
  197. * @umem: umem struct to release
  198. */
  199. void ib_umem_release(struct ib_umem *umem)
  200. {
  201. struct ib_ucontext *context = umem->context;
  202. struct mm_struct *mm;
  203. unsigned long diff;
  204. __ib_umem_release(umem->context->device, umem, 1);
  205. mm = get_task_mm(current);
  206. if (!mm) {
  207. kfree(umem);
  208. return;
  209. }
  210. diff = PAGE_ALIGN(umem->length + umem->offset) >> PAGE_SHIFT;
  211. /*
  212. * We may be called with the mm's mmap_sem already held. This
  213. * can happen when a userspace munmap() is the call that drops
  214. * the last reference to our file and calls our release
  215. * method. If there are memory regions to destroy, we'll end
  216. * up here and not be able to take the mmap_sem. In that case
  217. * we defer the vm_locked accounting to the system workqueue.
  218. */
  219. if (context->closing) {
  220. if (!down_write_trylock(&mm->mmap_sem)) {
  221. INIT_WORK(&umem->work, ib_umem_account);
  222. umem->mm = mm;
  223. umem->diff = diff;
  224. queue_work(ib_wq, &umem->work);
  225. return;
  226. }
  227. } else
  228. down_write(&mm->mmap_sem);
  229. current->mm->locked_vm -= diff;
  230. up_write(&mm->mmap_sem);
  231. mmput(mm);
  232. kfree(umem);
  233. }
  234. EXPORT_SYMBOL(ib_umem_release);
  235. int ib_umem_page_count(struct ib_umem *umem)
  236. {
  237. struct ib_umem_chunk *chunk;
  238. int shift;
  239. int i;
  240. int n;
  241. shift = ilog2(umem->page_size);
  242. n = 0;
  243. list_for_each_entry(chunk, &umem->chunk_list, list)
  244. for (i = 0; i < chunk->nmap; ++i)
  245. n += sg_dma_len(&chunk->page_list[i]) >> shift;
  246. return n;
  247. }
  248. EXPORT_SYMBOL(ib_umem_page_count);