umem.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349
  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/signal.h>
  37. #include <linux/sched/mm.h>
  38. #include <linux/export.h>
  39. #include <linux/hugetlb.h>
  40. #include <linux/slab.h>
  41. #include <rdma/ib_umem_odp.h>
  42. #include "uverbs.h"
  43. static void __ib_umem_release(struct ib_device *dev, struct ib_umem *umem, int dirty)
  44. {
  45. struct scatterlist *sg;
  46. struct page *page;
  47. int i;
  48. if (umem->nmap > 0)
  49. ib_dma_unmap_sg(dev, umem->sg_head.sgl,
  50. umem->npages,
  51. DMA_BIDIRECTIONAL);
  52. for_each_sg(umem->sg_head.sgl, sg, umem->npages, i) {
  53. page = sg_page(sg);
  54. if (!PageDirty(page) && umem->writable && dirty)
  55. set_page_dirty_lock(page);
  56. put_page(page);
  57. }
  58. sg_free_table(&umem->sg_head);
  59. }
  60. /**
  61. * ib_umem_get - Pin and DMA map userspace memory.
  62. *
  63. * If access flags indicate ODP memory, avoid pinning. Instead, stores
  64. * the mm for future page fault handling in conjunction with MMU notifiers.
  65. *
  66. * @context: userspace context to pin memory for
  67. * @addr: userspace virtual address to start at
  68. * @size: length of region to pin
  69. * @access: IB_ACCESS_xxx flags for memory being pinned
  70. * @dmasync: flush in-flight DMA when the memory region is written
  71. */
  72. struct ib_umem *ib_umem_get(struct ib_ucontext *context, unsigned long addr,
  73. size_t size, int access, int dmasync)
  74. {
  75. struct ib_umem *umem;
  76. struct page **page_list;
  77. struct vm_area_struct **vma_list;
  78. unsigned long lock_limit;
  79. unsigned long cur_base;
  80. unsigned long npages;
  81. int ret;
  82. int i;
  83. unsigned long dma_attrs = 0;
  84. struct scatterlist *sg, *sg_list_start;
  85. unsigned int gup_flags = FOLL_WRITE;
  86. if (dmasync)
  87. dma_attrs |= DMA_ATTR_WRITE_BARRIER;
  88. /*
  89. * If the combination of the addr and size requested for this memory
  90. * region causes an integer overflow, return error.
  91. */
  92. if (((addr + size) < addr) ||
  93. PAGE_ALIGN(addr + size) < (addr + size))
  94. return ERR_PTR(-EINVAL);
  95. if (!can_do_mlock())
  96. return ERR_PTR(-EPERM);
  97. umem = kzalloc(sizeof *umem, GFP_KERNEL);
  98. if (!umem)
  99. return ERR_PTR(-ENOMEM);
  100. umem->context = context;
  101. umem->length = size;
  102. umem->address = addr;
  103. umem->page_shift = PAGE_SHIFT;
  104. umem->writable = ib_access_writable(access);
  105. if (access & IB_ACCESS_ON_DEMAND) {
  106. ret = ib_umem_odp_get(context, umem, access);
  107. if (ret)
  108. goto umem_kfree;
  109. return umem;
  110. }
  111. umem->odp_data = NULL;
  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. ret = -ENOMEM;
  117. goto umem_kfree;
  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 = ib_umem_num_pages(umem);
  127. lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  128. down_write(&current->mm->mmap_sem);
  129. current->mm->pinned_vm += npages;
  130. if ((current->mm->pinned_vm > lock_limit) && !capable(CAP_IPC_LOCK)) {
  131. up_write(&current->mm->mmap_sem);
  132. ret = -ENOMEM;
  133. goto vma;
  134. }
  135. up_write(&current->mm->mmap_sem);
  136. cur_base = addr & PAGE_MASK;
  137. if (npages == 0 || npages > UINT_MAX) {
  138. ret = -EINVAL;
  139. goto vma;
  140. }
  141. ret = sg_alloc_table(&umem->sg_head, npages, GFP_KERNEL);
  142. if (ret)
  143. goto vma;
  144. if (!umem->writable)
  145. gup_flags |= FOLL_FORCE;
  146. sg_list_start = umem->sg_head.sgl;
  147. down_read(&current->mm->mmap_sem);
  148. while (npages) {
  149. ret = get_user_pages_longterm(cur_base,
  150. min_t(unsigned long, npages,
  151. PAGE_SIZE / sizeof (struct page *)),
  152. gup_flags, page_list, vma_list);
  153. if (ret < 0) {
  154. up_read(&current->mm->mmap_sem);
  155. goto umem_release;
  156. }
  157. umem->npages += ret;
  158. cur_base += ret * PAGE_SIZE;
  159. npages -= ret;
  160. for_each_sg(sg_list_start, sg, ret, i) {
  161. if (vma_list && !is_vm_hugetlb_page(vma_list[i]))
  162. umem->hugetlb = 0;
  163. sg_set_page(sg, page_list[i], PAGE_SIZE, 0);
  164. }
  165. /* preparing for next loop */
  166. sg_list_start = sg;
  167. }
  168. up_read(&current->mm->mmap_sem);
  169. umem->nmap = ib_dma_map_sg_attrs(context->device,
  170. umem->sg_head.sgl,
  171. umem->npages,
  172. DMA_BIDIRECTIONAL,
  173. dma_attrs);
  174. if (!umem->nmap) {
  175. ret = -ENOMEM;
  176. goto umem_release;
  177. }
  178. ret = 0;
  179. goto out;
  180. umem_release:
  181. __ib_umem_release(context->device, umem, 0);
  182. vma:
  183. down_write(&current->mm->mmap_sem);
  184. current->mm->pinned_vm -= ib_umem_num_pages(umem);
  185. up_write(&current->mm->mmap_sem);
  186. out:
  187. if (vma_list)
  188. free_page((unsigned long) vma_list);
  189. free_page((unsigned long) page_list);
  190. umem_kfree:
  191. if (ret)
  192. kfree(umem);
  193. return ret ? ERR_PTR(ret) : umem;
  194. }
  195. EXPORT_SYMBOL(ib_umem_get);
  196. static void ib_umem_account(struct work_struct *work)
  197. {
  198. struct ib_umem *umem = container_of(work, struct ib_umem, work);
  199. down_write(&umem->mm->mmap_sem);
  200. umem->mm->pinned_vm -= umem->diff;
  201. up_write(&umem->mm->mmap_sem);
  202. mmput(umem->mm);
  203. kfree(umem);
  204. }
  205. /**
  206. * ib_umem_release - release memory pinned with ib_umem_get
  207. * @umem: umem struct to release
  208. */
  209. void ib_umem_release(struct ib_umem *umem)
  210. {
  211. struct ib_ucontext *context = umem->context;
  212. struct mm_struct *mm;
  213. struct task_struct *task;
  214. unsigned long diff;
  215. if (umem->odp_data) {
  216. ib_umem_odp_release(umem);
  217. return;
  218. }
  219. __ib_umem_release(umem->context->device, umem, 1);
  220. task = get_pid_task(umem->context->tgid, PIDTYPE_PID);
  221. if (!task)
  222. goto out;
  223. mm = get_task_mm(task);
  224. put_task_struct(task);
  225. if (!mm)
  226. goto out;
  227. diff = ib_umem_num_pages(umem);
  228. /*
  229. * We may be called with the mm's mmap_sem already held. This
  230. * can happen when a userspace munmap() is the call that drops
  231. * the last reference to our file and calls our release
  232. * method. If there are memory regions to destroy, we'll end
  233. * up here and not be able to take the mmap_sem. In that case
  234. * we defer the vm_locked accounting to the system workqueue.
  235. */
  236. if (context->closing) {
  237. if (!down_write_trylock(&mm->mmap_sem)) {
  238. INIT_WORK(&umem->work, ib_umem_account);
  239. umem->mm = mm;
  240. umem->diff = diff;
  241. queue_work(ib_wq, &umem->work);
  242. return;
  243. }
  244. } else
  245. down_write(&mm->mmap_sem);
  246. mm->pinned_vm -= diff;
  247. up_write(&mm->mmap_sem);
  248. mmput(mm);
  249. out:
  250. kfree(umem);
  251. }
  252. EXPORT_SYMBOL(ib_umem_release);
  253. int ib_umem_page_count(struct ib_umem *umem)
  254. {
  255. int i;
  256. int n;
  257. struct scatterlist *sg;
  258. if (umem->odp_data)
  259. return ib_umem_num_pages(umem);
  260. n = 0;
  261. for_each_sg(umem->sg_head.sgl, sg, umem->nmap, i)
  262. n += sg_dma_len(sg) >> umem->page_shift;
  263. return n;
  264. }
  265. EXPORT_SYMBOL(ib_umem_page_count);
  266. /*
  267. * Copy from the given ib_umem's pages to the given buffer.
  268. *
  269. * umem - the umem to copy from
  270. * offset - offset to start copying from
  271. * dst - destination buffer
  272. * length - buffer length
  273. *
  274. * Returns 0 on success, or an error code.
  275. */
  276. int ib_umem_copy_from(void *dst, struct ib_umem *umem, size_t offset,
  277. size_t length)
  278. {
  279. size_t end = offset + length;
  280. int ret;
  281. if (offset > umem->length || length > umem->length - offset) {
  282. pr_err("ib_umem_copy_from not in range. offset: %zd umem length: %zd end: %zd\n",
  283. offset, umem->length, end);
  284. return -EINVAL;
  285. }
  286. ret = sg_pcopy_to_buffer(umem->sg_head.sgl, umem->npages, dst, length,
  287. offset + ib_umem_offset(umem));
  288. if (ret < 0)
  289. return ret;
  290. else if (ret != length)
  291. return -EINVAL;
  292. else
  293. return 0;
  294. }
  295. EXPORT_SYMBOL(ib_umem_copy_from);