umem.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368
  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/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 (umem->writable && dirty)
  55. set_page_dirty_lock(page);
  56. put_page(page);
  57. }
  58. sg_free_table(&umem->sg_head);
  59. return;
  60. }
  61. /**
  62. * ib_umem_get - Pin and DMA map userspace memory.
  63. *
  64. * If access flags indicate ODP memory, avoid pinning. Instead, stores
  65. * the mm for future page fault handling in conjunction with MMU notifiers.
  66. *
  67. * @context: userspace context to pin memory for
  68. * @addr: userspace virtual address to start at
  69. * @size: length of region to pin
  70. * @access: IB_ACCESS_xxx flags for memory being pinned
  71. * @dmasync: flush in-flight DMA when the memory region is written
  72. */
  73. struct ib_umem *ib_umem_get(struct ib_ucontext *context, unsigned long addr,
  74. size_t size, int access, int dmasync)
  75. {
  76. struct ib_umem *umem;
  77. struct page **page_list;
  78. struct vm_area_struct **vma_list;
  79. unsigned long locked;
  80. unsigned long lock_limit;
  81. unsigned long cur_base;
  82. unsigned long npages;
  83. int ret;
  84. int i;
  85. unsigned long dma_attrs = 0;
  86. struct scatterlist *sg, *sg_list_start;
  87. int need_release = 0;
  88. unsigned int gup_flags = FOLL_WRITE;
  89. if (dmasync)
  90. dma_attrs |= DMA_ATTR_WRITE_BARRIER;
  91. /*
  92. * If the combination of the addr and size requested for this memory
  93. * region causes an integer overflow, return error.
  94. */
  95. if (((addr + size) < addr) ||
  96. PAGE_ALIGN(addr + size) < (addr + size))
  97. return ERR_PTR(-EINVAL);
  98. if (!can_do_mlock())
  99. return ERR_PTR(-EPERM);
  100. umem = kzalloc(sizeof *umem, GFP_KERNEL);
  101. if (!umem)
  102. return ERR_PTR(-ENOMEM);
  103. umem->context = context;
  104. umem->length = size;
  105. umem->address = addr;
  106. umem->page_size = PAGE_SIZE;
  107. umem->pid = get_task_pid(current, PIDTYPE_PID);
  108. /*
  109. * We ask for writable memory if any of the following
  110. * access flags are set. "Local write" and "remote write"
  111. * obviously require write access. "Remote atomic" can do
  112. * things like fetch and add, which will modify memory, and
  113. * "MW bind" can change permissions by binding a window.
  114. */
  115. umem->writable = !!(access &
  116. (IB_ACCESS_LOCAL_WRITE | IB_ACCESS_REMOTE_WRITE |
  117. IB_ACCESS_REMOTE_ATOMIC | IB_ACCESS_MW_BIND));
  118. if (access & IB_ACCESS_ON_DEMAND) {
  119. put_pid(umem->pid);
  120. ret = ib_umem_odp_get(context, umem);
  121. if (ret) {
  122. kfree(umem);
  123. return ERR_PTR(ret);
  124. }
  125. return umem;
  126. }
  127. umem->odp_data = NULL;
  128. /* We assume the memory is from hugetlb until proved otherwise */
  129. umem->hugetlb = 1;
  130. page_list = (struct page **) __get_free_page(GFP_KERNEL);
  131. if (!page_list) {
  132. put_pid(umem->pid);
  133. kfree(umem);
  134. return ERR_PTR(-ENOMEM);
  135. }
  136. /*
  137. * if we can't alloc the vma_list, it's not so bad;
  138. * just assume the memory is not hugetlb memory
  139. */
  140. vma_list = (struct vm_area_struct **) __get_free_page(GFP_KERNEL);
  141. if (!vma_list)
  142. umem->hugetlb = 0;
  143. npages = ib_umem_num_pages(umem);
  144. down_write(&current->mm->mmap_sem);
  145. locked = npages + current->mm->pinned_vm;
  146. lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  147. if ((locked > lock_limit) && !capable(CAP_IPC_LOCK)) {
  148. ret = -ENOMEM;
  149. goto out;
  150. }
  151. cur_base = addr & PAGE_MASK;
  152. if (npages == 0 || npages > UINT_MAX) {
  153. ret = -EINVAL;
  154. goto out;
  155. }
  156. ret = sg_alloc_table(&umem->sg_head, npages, GFP_KERNEL);
  157. if (ret)
  158. goto out;
  159. if (!umem->writable)
  160. gup_flags |= FOLL_FORCE;
  161. need_release = 1;
  162. sg_list_start = umem->sg_head.sgl;
  163. while (npages) {
  164. ret = get_user_pages(cur_base,
  165. min_t(unsigned long, npages,
  166. PAGE_SIZE / sizeof (struct page *)),
  167. gup_flags, page_list, vma_list);
  168. if (ret < 0)
  169. goto out;
  170. umem->npages += ret;
  171. cur_base += ret * PAGE_SIZE;
  172. npages -= ret;
  173. for_each_sg(sg_list_start, sg, ret, i) {
  174. if (vma_list && !is_vm_hugetlb_page(vma_list[i]))
  175. umem->hugetlb = 0;
  176. sg_set_page(sg, page_list[i], PAGE_SIZE, 0);
  177. }
  178. /* preparing for next loop */
  179. sg_list_start = sg;
  180. }
  181. umem->nmap = ib_dma_map_sg_attrs(context->device,
  182. umem->sg_head.sgl,
  183. umem->npages,
  184. DMA_BIDIRECTIONAL,
  185. dma_attrs);
  186. if (umem->nmap <= 0) {
  187. ret = -ENOMEM;
  188. goto out;
  189. }
  190. ret = 0;
  191. out:
  192. if (ret < 0) {
  193. if (need_release)
  194. __ib_umem_release(context->device, umem, 0);
  195. put_pid(umem->pid);
  196. kfree(umem);
  197. } else
  198. current->mm->pinned_vm = locked;
  199. up_write(&current->mm->mmap_sem);
  200. if (vma_list)
  201. free_page((unsigned long) vma_list);
  202. free_page((unsigned long) page_list);
  203. return ret < 0 ? ERR_PTR(ret) : umem;
  204. }
  205. EXPORT_SYMBOL(ib_umem_get);
  206. static void ib_umem_account(struct work_struct *work)
  207. {
  208. struct ib_umem *umem = container_of(work, struct ib_umem, work);
  209. down_write(&umem->mm->mmap_sem);
  210. umem->mm->pinned_vm -= umem->diff;
  211. up_write(&umem->mm->mmap_sem);
  212. mmput(umem->mm);
  213. kfree(umem);
  214. }
  215. /**
  216. * ib_umem_release - release memory pinned with ib_umem_get
  217. * @umem: umem struct to release
  218. */
  219. void ib_umem_release(struct ib_umem *umem)
  220. {
  221. struct ib_ucontext *context = umem->context;
  222. struct mm_struct *mm;
  223. struct task_struct *task;
  224. unsigned long diff;
  225. if (umem->odp_data) {
  226. ib_umem_odp_release(umem);
  227. return;
  228. }
  229. __ib_umem_release(umem->context->device, umem, 1);
  230. task = get_pid_task(umem->pid, PIDTYPE_PID);
  231. put_pid(umem->pid);
  232. if (!task)
  233. goto out;
  234. mm = get_task_mm(task);
  235. put_task_struct(task);
  236. if (!mm)
  237. goto out;
  238. diff = ib_umem_num_pages(umem);
  239. /*
  240. * We may be called with the mm's mmap_sem already held. This
  241. * can happen when a userspace munmap() is the call that drops
  242. * the last reference to our file and calls our release
  243. * method. If there are memory regions to destroy, we'll end
  244. * up here and not be able to take the mmap_sem. In that case
  245. * we defer the vm_locked accounting to the system workqueue.
  246. */
  247. if (context->closing) {
  248. if (!down_write_trylock(&mm->mmap_sem)) {
  249. INIT_WORK(&umem->work, ib_umem_account);
  250. umem->mm = mm;
  251. umem->diff = diff;
  252. queue_work(ib_wq, &umem->work);
  253. return;
  254. }
  255. } else
  256. down_write(&mm->mmap_sem);
  257. mm->pinned_vm -= diff;
  258. up_write(&mm->mmap_sem);
  259. mmput(mm);
  260. out:
  261. kfree(umem);
  262. }
  263. EXPORT_SYMBOL(ib_umem_release);
  264. int ib_umem_page_count(struct ib_umem *umem)
  265. {
  266. int shift;
  267. int i;
  268. int n;
  269. struct scatterlist *sg;
  270. if (umem->odp_data)
  271. return ib_umem_num_pages(umem);
  272. shift = ilog2(umem->page_size);
  273. n = 0;
  274. for_each_sg(umem->sg_head.sgl, sg, umem->nmap, i)
  275. n += sg_dma_len(sg) >> shift;
  276. return n;
  277. }
  278. EXPORT_SYMBOL(ib_umem_page_count);
  279. /*
  280. * Copy from the given ib_umem's pages to the given buffer.
  281. *
  282. * umem - the umem to copy from
  283. * offset - offset to start copying from
  284. * dst - destination buffer
  285. * length - buffer length
  286. *
  287. * Returns 0 on success, or an error code.
  288. */
  289. int ib_umem_copy_from(void *dst, struct ib_umem *umem, size_t offset,
  290. size_t length)
  291. {
  292. size_t end = offset + length;
  293. int ret;
  294. if (offset > umem->length || length > umem->length - offset) {
  295. pr_err("ib_umem_copy_from not in range. offset: %zd umem length: %zd end: %zd\n",
  296. offset, umem->length, end);
  297. return -EINVAL;
  298. }
  299. ret = sg_pcopy_to_buffer(umem->sg_head.sgl, umem->nmap, dst, length,
  300. offset + ib_umem_offset(umem));
  301. if (ret < 0)
  302. return ret;
  303. else if (ret != length)
  304. return -EINVAL;
  305. else
  306. return 0;
  307. }
  308. EXPORT_SYMBOL(ib_umem_copy_from);