umem.c 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305
  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. static void __ib_umem_release(struct ib_device *dev, struct ib_umem *umem, int dirty)
  43. {
  44. struct scatterlist *sg;
  45. struct page *page;
  46. int i;
  47. if (umem->nmap > 0)
  48. ib_dma_unmap_sg(dev, umem->sg_head.sgl,
  49. umem->nmap,
  50. DMA_BIDIRECTIONAL);
  51. for_each_sg(umem->sg_head.sgl, sg, umem->npages, i) {
  52. page = sg_page(sg);
  53. if (umem->writable && dirty)
  54. set_page_dirty_lock(page);
  55. put_page(page);
  56. }
  57. sg_free_table(&umem->sg_head);
  58. return;
  59. }
  60. /**
  61. * ib_umem_get - Pin and DMA map userspace memory.
  62. * @context: userspace context to pin memory for
  63. * @addr: userspace virtual address to start at
  64. * @size: length of region to pin
  65. * @access: IB_ACCESS_xxx flags for memory being pinned
  66. * @dmasync: flush in-flight DMA when the memory region is written
  67. */
  68. struct ib_umem *ib_umem_get(struct ib_ucontext *context, unsigned long addr,
  69. size_t size, int access, int dmasync)
  70. {
  71. struct ib_umem *umem;
  72. struct page **page_list;
  73. struct vm_area_struct **vma_list;
  74. unsigned long locked;
  75. unsigned long lock_limit;
  76. unsigned long cur_base;
  77. unsigned long npages;
  78. int ret;
  79. int i;
  80. DEFINE_DMA_ATTRS(attrs);
  81. struct scatterlist *sg, *sg_list_start;
  82. int need_release = 0;
  83. if (dmasync)
  84. dma_set_attr(DMA_ATTR_WRITE_BARRIER, &attrs);
  85. if (!size)
  86. return ERR_PTR(-EINVAL);
  87. /*
  88. * If the combination of the addr and size requested for this memory
  89. * region causes an integer overflow, return error.
  90. */
  91. if (((addr + size) < addr) ||
  92. PAGE_ALIGN(addr + size) < (addr + size))
  93. return ERR_PTR(-EINVAL);
  94. if (!can_do_mlock())
  95. return ERR_PTR(-EPERM);
  96. umem = kzalloc(sizeof *umem, GFP_KERNEL);
  97. if (!umem)
  98. return ERR_PTR(-ENOMEM);
  99. umem->context = context;
  100. umem->length = size;
  101. umem->offset = addr & ~PAGE_MASK;
  102. umem->page_size = PAGE_SIZE;
  103. umem->pid = get_task_pid(current, PIDTYPE_PID);
  104. /*
  105. * We ask for writable memory if any access flags other than
  106. * "remote read" are set. "Local write" and "remote write"
  107. * obviously require write access. "Remote atomic" can do
  108. * things like fetch and add, which will modify memory, and
  109. * "MW bind" can change permissions by binding a window.
  110. */
  111. umem->writable = !!(access & ~IB_ACCESS_REMOTE_READ);
  112. /* We assume the memory is from hugetlb until proved otherwise */
  113. umem->hugetlb = 1;
  114. page_list = (struct page **) __get_free_page(GFP_KERNEL);
  115. if (!page_list) {
  116. kfree(umem);
  117. return ERR_PTR(-ENOMEM);
  118. }
  119. /*
  120. * if we can't alloc the vma_list, it's not so bad;
  121. * just assume the memory is not hugetlb memory
  122. */
  123. vma_list = (struct vm_area_struct **) __get_free_page(GFP_KERNEL);
  124. if (!vma_list)
  125. umem->hugetlb = 0;
  126. npages = PAGE_ALIGN(size + umem->offset) >> PAGE_SHIFT;
  127. down_write(&current->mm->mmap_sem);
  128. locked = npages + current->mm->pinned_vm;
  129. lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  130. if ((locked > lock_limit) && !capable(CAP_IPC_LOCK)) {
  131. ret = -ENOMEM;
  132. goto out;
  133. }
  134. cur_base = addr & PAGE_MASK;
  135. if (npages == 0) {
  136. ret = -EINVAL;
  137. goto out;
  138. }
  139. ret = sg_alloc_table(&umem->sg_head, npages, GFP_KERNEL);
  140. if (ret)
  141. goto out;
  142. need_release = 1;
  143. sg_list_start = umem->sg_head.sgl;
  144. while (npages) {
  145. ret = get_user_pages(current, current->mm, cur_base,
  146. min_t(unsigned long, npages,
  147. PAGE_SIZE / sizeof (struct page *)),
  148. 1, !umem->writable, page_list, vma_list);
  149. if (ret < 0)
  150. goto out;
  151. umem->npages += ret;
  152. cur_base += ret * PAGE_SIZE;
  153. npages -= ret;
  154. for_each_sg(sg_list_start, sg, ret, i) {
  155. if (vma_list && !is_vm_hugetlb_page(vma_list[i]))
  156. umem->hugetlb = 0;
  157. sg_set_page(sg, page_list[i], PAGE_SIZE, 0);
  158. }
  159. /* preparing for next loop */
  160. sg_list_start = sg;
  161. }
  162. umem->nmap = ib_dma_map_sg_attrs(context->device,
  163. umem->sg_head.sgl,
  164. umem->npages,
  165. DMA_BIDIRECTIONAL,
  166. &attrs);
  167. if (umem->nmap <= 0) {
  168. ret = -ENOMEM;
  169. goto out;
  170. }
  171. ret = 0;
  172. out:
  173. if (ret < 0) {
  174. if (need_release)
  175. __ib_umem_release(context->device, umem, 0);
  176. put_pid(umem->pid);
  177. kfree(umem);
  178. } else
  179. current->mm->pinned_vm = locked;
  180. up_write(&current->mm->mmap_sem);
  181. if (vma_list)
  182. free_page((unsigned long) vma_list);
  183. free_page((unsigned long) page_list);
  184. return ret < 0 ? ERR_PTR(ret) : umem;
  185. }
  186. EXPORT_SYMBOL(ib_umem_get);
  187. static void ib_umem_account(struct work_struct *work)
  188. {
  189. struct ib_umem *umem = container_of(work, struct ib_umem, work);
  190. down_write(&umem->mm->mmap_sem);
  191. umem->mm->pinned_vm -= umem->diff;
  192. up_write(&umem->mm->mmap_sem);
  193. mmput(umem->mm);
  194. kfree(umem);
  195. }
  196. /**
  197. * ib_umem_release - release memory pinned with ib_umem_get
  198. * @umem: umem struct to release
  199. */
  200. void ib_umem_release(struct ib_umem *umem)
  201. {
  202. struct ib_ucontext *context = umem->context;
  203. struct mm_struct *mm;
  204. struct task_struct *task;
  205. unsigned long diff;
  206. __ib_umem_release(umem->context->device, umem, 1);
  207. task = get_pid_task(umem->pid, PIDTYPE_PID);
  208. put_pid(umem->pid);
  209. if (!task)
  210. goto out;
  211. mm = get_task_mm(task);
  212. put_task_struct(task);
  213. if (!mm)
  214. goto out;
  215. diff = PAGE_ALIGN(umem->length + umem->offset) >> PAGE_SHIFT;
  216. /*
  217. * We may be called with the mm's mmap_sem already held. This
  218. * can happen when a userspace munmap() is the call that drops
  219. * the last reference to our file and calls our release
  220. * method. If there are memory regions to destroy, we'll end
  221. * up here and not be able to take the mmap_sem. In that case
  222. * we defer the vm_locked accounting to the system workqueue.
  223. */
  224. if (context->closing) {
  225. if (!down_write_trylock(&mm->mmap_sem)) {
  226. INIT_WORK(&umem->work, ib_umem_account);
  227. umem->mm = mm;
  228. umem->diff = diff;
  229. queue_work(ib_wq, &umem->work);
  230. return;
  231. }
  232. } else
  233. down_write(&mm->mmap_sem);
  234. mm->pinned_vm -= diff;
  235. up_write(&mm->mmap_sem);
  236. mmput(mm);
  237. out:
  238. kfree(umem);
  239. }
  240. EXPORT_SYMBOL(ib_umem_release);
  241. int ib_umem_page_count(struct ib_umem *umem)
  242. {
  243. int shift;
  244. int i;
  245. int n;
  246. struct scatterlist *sg;
  247. shift = ilog2(umem->page_size);
  248. n = 0;
  249. for_each_sg(umem->sg_head.sgl, sg, umem->nmap, i)
  250. n += sg_dma_len(sg) >> shift;
  251. return n;
  252. }
  253. EXPORT_SYMBOL(ib_umem_page_count);