umem.c 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307
  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 (!size)
  88. return ERR_PTR(-EINVAL);
  89. /*
  90. * If the combination of the addr and size requested for this memory
  91. * region causes an integer overflow, return error.
  92. */
  93. if (((addr + size) < addr) ||
  94. PAGE_ALIGN(addr + size) < (addr + size))
  95. return ERR_PTR(-EINVAL);
  96. if (!can_do_mlock())
  97. return ERR_PTR(-EPERM);
  98. umem = kmalloc(sizeof *umem, GFP_KERNEL);
  99. if (!umem)
  100. return ERR_PTR(-ENOMEM);
  101. umem->context = context;
  102. umem->length = size;
  103. umem->offset = addr & ~PAGE_MASK;
  104. umem->page_size = PAGE_SIZE;
  105. /*
  106. * We ask for writable memory if any access flags other than
  107. * "remote read" are set. "Local write" and "remote write"
  108. * obviously require write access. "Remote atomic" can do
  109. * things like fetch and add, which will modify memory, and
  110. * "MW bind" can change permissions by binding a window.
  111. */
  112. umem->writable = !!(access & ~IB_ACCESS_REMOTE_READ);
  113. /* We assume the memory is from hugetlb until proved otherwise */
  114. umem->hugetlb = 1;
  115. INIT_LIST_HEAD(&umem->chunk_list);
  116. page_list = (struct page **) __get_free_page(GFP_KERNEL);
  117. if (!page_list) {
  118. kfree(umem);
  119. return ERR_PTR(-ENOMEM);
  120. }
  121. /*
  122. * if we can't alloc the vma_list, it's not so bad;
  123. * just assume the memory is not hugetlb memory
  124. */
  125. vma_list = (struct vm_area_struct **) __get_free_page(GFP_KERNEL);
  126. if (!vma_list)
  127. umem->hugetlb = 0;
  128. npages = PAGE_ALIGN(size + umem->offset) >> PAGE_SHIFT;
  129. down_write(&current->mm->mmap_sem);
  130. locked = npages + current->mm->pinned_vm;
  131. lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  132. if ((locked > lock_limit) && !capable(CAP_IPC_LOCK)) {
  133. ret = -ENOMEM;
  134. goto out;
  135. }
  136. cur_base = addr & PAGE_MASK;
  137. ret = 0;
  138. while (npages) {
  139. ret = get_user_pages(current, current->mm, cur_base,
  140. min_t(unsigned long, npages,
  141. PAGE_SIZE / sizeof (struct page *)),
  142. 1, !umem->writable, page_list, vma_list);
  143. if (ret < 0)
  144. goto out;
  145. cur_base += ret * PAGE_SIZE;
  146. npages -= ret;
  147. off = 0;
  148. while (ret) {
  149. chunk = kmalloc(sizeof *chunk + sizeof (struct scatterlist) *
  150. min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK),
  151. GFP_KERNEL);
  152. if (!chunk) {
  153. ret = -ENOMEM;
  154. goto out;
  155. }
  156. chunk->nents = min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK);
  157. sg_init_table(chunk->page_list, chunk->nents);
  158. for (i = 0; i < chunk->nents; ++i) {
  159. if (vma_list &&
  160. !is_vm_hugetlb_page(vma_list[i + off]))
  161. umem->hugetlb = 0;
  162. sg_set_page(&chunk->page_list[i], page_list[i + off], PAGE_SIZE, 0);
  163. }
  164. chunk->nmap = ib_dma_map_sg_attrs(context->device,
  165. &chunk->page_list[0],
  166. chunk->nents,
  167. DMA_BIDIRECTIONAL,
  168. &attrs);
  169. if (chunk->nmap <= 0) {
  170. for (i = 0; i < chunk->nents; ++i)
  171. put_page(sg_page(&chunk->page_list[i]));
  172. kfree(chunk);
  173. ret = -ENOMEM;
  174. goto out;
  175. }
  176. ret -= chunk->nents;
  177. off += chunk->nents;
  178. list_add_tail(&chunk->list, &umem->chunk_list);
  179. }
  180. ret = 0;
  181. }
  182. out:
  183. if (ret < 0) {
  184. __ib_umem_release(context->device, umem, 0);
  185. kfree(umem);
  186. } else
  187. current->mm->pinned_vm = locked;
  188. up_write(&current->mm->mmap_sem);
  189. if (vma_list)
  190. free_page((unsigned long) vma_list);
  191. free_page((unsigned long) page_list);
  192. return ret < 0 ? ERR_PTR(ret) : umem;
  193. }
  194. EXPORT_SYMBOL(ib_umem_get);
  195. static void ib_umem_account(struct work_struct *work)
  196. {
  197. struct ib_umem *umem = container_of(work, struct ib_umem, work);
  198. down_write(&umem->mm->mmap_sem);
  199. umem->mm->pinned_vm -= umem->diff;
  200. up_write(&umem->mm->mmap_sem);
  201. mmput(umem->mm);
  202. kfree(umem);
  203. }
  204. /**
  205. * ib_umem_release - release memory pinned with ib_umem_get
  206. * @umem: umem struct to release
  207. */
  208. void ib_umem_release(struct ib_umem *umem)
  209. {
  210. struct ib_ucontext *context = umem->context;
  211. struct mm_struct *mm;
  212. unsigned long diff;
  213. __ib_umem_release(umem->context->device, umem, 1);
  214. mm = get_task_mm(current);
  215. if (!mm) {
  216. kfree(umem);
  217. return;
  218. }
  219. diff = PAGE_ALIGN(umem->length + umem->offset) >> PAGE_SHIFT;
  220. /*
  221. * We may be called with the mm's mmap_sem already held. This
  222. * can happen when a userspace munmap() is the call that drops
  223. * the last reference to our file and calls our release
  224. * method. If there are memory regions to destroy, we'll end
  225. * up here and not be able to take the mmap_sem. In that case
  226. * we defer the vm_locked accounting to the system workqueue.
  227. */
  228. if (context->closing) {
  229. if (!down_write_trylock(&mm->mmap_sem)) {
  230. INIT_WORK(&umem->work, ib_umem_account);
  231. umem->mm = mm;
  232. umem->diff = diff;
  233. queue_work(ib_wq, &umem->work);
  234. return;
  235. }
  236. } else
  237. down_write(&mm->mmap_sem);
  238. current->mm->pinned_vm -= diff;
  239. up_write(&mm->mmap_sem);
  240. mmput(mm);
  241. kfree(umem);
  242. }
  243. EXPORT_SYMBOL(ib_umem_release);
  244. int ib_umem_page_count(struct ib_umem *umem)
  245. {
  246. struct ib_umem_chunk *chunk;
  247. int shift;
  248. int i;
  249. int n;
  250. shift = ilog2(umem->page_size);
  251. n = 0;
  252. list_for_each_entry(chunk, &umem->chunk_list, list)
  253. for (i = 0; i < chunk->nmap; ++i)
  254. n += sg_dma_len(&chunk->page_list[i]) >> shift;
  255. return n;
  256. }
  257. EXPORT_SYMBOL(ib_umem_page_count);