umem.c 9.0 KB

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