umem.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287
  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. * $Id: uverbs_mem.c 2743 2005-06-28 22:27:59Z roland $
  35. */
  36. #include <linux/mm.h>
  37. #include <linux/dma-mapping.h>
  38. #include <linux/sched.h>
  39. #include <linux/hugetlb.h>
  40. #include "uverbs.h"
  41. #define IB_UMEM_MAX_PAGE_CHUNK \
  42. ((PAGE_SIZE - offsetof(struct ib_umem_chunk, page_list)) / \
  43. ((void *) &((struct ib_umem_chunk *) 0)->page_list[1] - \
  44. (void *) &((struct ib_umem_chunk *) 0)->page_list[0]))
  45. static void __ib_umem_release(struct ib_device *dev, struct ib_umem *umem, int dirty)
  46. {
  47. struct ib_umem_chunk *chunk, *tmp;
  48. int i;
  49. list_for_each_entry_safe(chunk, tmp, &umem->chunk_list, list) {
  50. ib_dma_unmap_sg(dev, chunk->page_list,
  51. chunk->nents, DMA_BIDIRECTIONAL);
  52. for (i = 0; i < chunk->nents; ++i) {
  53. if (umem->writable && dirty)
  54. set_page_dirty_lock(chunk->page_list[i].page);
  55. put_page(chunk->page_list[i].page);
  56. }
  57. kfree(chunk);
  58. }
  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. */
  67. struct ib_umem *ib_umem_get(struct ib_ucontext *context, unsigned long addr,
  68. size_t size, int access)
  69. {
  70. struct ib_umem *umem;
  71. struct page **page_list;
  72. struct vm_area_struct **vma_list;
  73. struct ib_umem_chunk *chunk;
  74. unsigned long locked;
  75. unsigned long lock_limit;
  76. unsigned long cur_base;
  77. unsigned long npages;
  78. int ret;
  79. int off;
  80. int i;
  81. if (!can_do_mlock())
  82. return ERR_PTR(-EPERM);
  83. umem = kmalloc(sizeof *umem, GFP_KERNEL);
  84. if (!umem)
  85. return ERR_PTR(-ENOMEM);
  86. umem->context = context;
  87. umem->length = size;
  88. umem->offset = addr & ~PAGE_MASK;
  89. umem->page_size = PAGE_SIZE;
  90. /*
  91. * We ask for writable memory if any access flags other than
  92. * "remote read" are set. "Local write" and "remote write"
  93. * obviously require write access. "Remote atomic" can do
  94. * things like fetch and add, which will modify memory, and
  95. * "MW bind" can change permissions by binding a window.
  96. */
  97. umem->writable = !!(access & ~IB_ACCESS_REMOTE_READ);
  98. /* We assume the memory is from hugetlb until proved otherwise */
  99. umem->hugetlb = 1;
  100. INIT_LIST_HEAD(&umem->chunk_list);
  101. page_list = (struct page **) __get_free_page(GFP_KERNEL);
  102. if (!page_list) {
  103. kfree(umem);
  104. return ERR_PTR(-ENOMEM);
  105. }
  106. /*
  107. * if we can't alloc the vma_list, it's not so bad;
  108. * just assume the memory is not hugetlb memory
  109. */
  110. vma_list = (struct vm_area_struct **) __get_free_page(GFP_KERNEL);
  111. if (!vma_list)
  112. umem->hugetlb = 0;
  113. npages = PAGE_ALIGN(size + umem->offset) >> PAGE_SHIFT;
  114. down_write(&current->mm->mmap_sem);
  115. locked = npages + current->mm->locked_vm;
  116. lock_limit = current->signal->rlim[RLIMIT_MEMLOCK].rlim_cur >> PAGE_SHIFT;
  117. if ((locked > lock_limit) && !capable(CAP_IPC_LOCK)) {
  118. ret = -ENOMEM;
  119. goto out;
  120. }
  121. cur_base = addr & PAGE_MASK;
  122. ret = 0;
  123. while (npages) {
  124. ret = get_user_pages(current, current->mm, cur_base,
  125. min_t(int, npages,
  126. PAGE_SIZE / sizeof (struct page *)),
  127. 1, !umem->writable, page_list, vma_list);
  128. if (ret < 0)
  129. goto out;
  130. cur_base += ret * PAGE_SIZE;
  131. npages -= ret;
  132. off = 0;
  133. while (ret) {
  134. chunk = kmalloc(sizeof *chunk + sizeof (struct scatterlist) *
  135. min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK),
  136. GFP_KERNEL);
  137. if (!chunk) {
  138. ret = -ENOMEM;
  139. goto out;
  140. }
  141. chunk->nents = min_t(int, ret, IB_UMEM_MAX_PAGE_CHUNK);
  142. for (i = 0; i < chunk->nents; ++i) {
  143. if (vma_list &&
  144. !is_vm_hugetlb_page(vma_list[i + off]))
  145. umem->hugetlb = 0;
  146. chunk->page_list[i].page = page_list[i + off];
  147. chunk->page_list[i].offset = 0;
  148. chunk->page_list[i].length = PAGE_SIZE;
  149. }
  150. chunk->nmap = ib_dma_map_sg(context->device,
  151. &chunk->page_list[0],
  152. chunk->nents,
  153. DMA_BIDIRECTIONAL);
  154. if (chunk->nmap <= 0) {
  155. for (i = 0; i < chunk->nents; ++i)
  156. put_page(chunk->page_list[i].page);
  157. kfree(chunk);
  158. ret = -ENOMEM;
  159. goto out;
  160. }
  161. ret -= chunk->nents;
  162. off += chunk->nents;
  163. list_add_tail(&chunk->list, &umem->chunk_list);
  164. }
  165. ret = 0;
  166. }
  167. out:
  168. if (ret < 0) {
  169. __ib_umem_release(context->device, umem, 0);
  170. kfree(umem);
  171. } else
  172. current->mm->locked_vm = locked;
  173. up_write(&current->mm->mmap_sem);
  174. if (vma_list)
  175. free_page((unsigned long) vma_list);
  176. free_page((unsigned long) page_list);
  177. return ret < 0 ? ERR_PTR(ret) : umem;
  178. }
  179. EXPORT_SYMBOL(ib_umem_get);
  180. static void ib_umem_account(struct work_struct *work)
  181. {
  182. struct ib_umem *umem = container_of(work, struct ib_umem, work);
  183. down_write(&umem->mm->mmap_sem);
  184. umem->mm->locked_vm -= umem->diff;
  185. up_write(&umem->mm->mmap_sem);
  186. mmput(umem->mm);
  187. kfree(umem);
  188. }
  189. /**
  190. * ib_umem_release - release memory pinned with ib_umem_get
  191. * @umem: umem struct to release
  192. */
  193. void ib_umem_release(struct ib_umem *umem)
  194. {
  195. struct ib_ucontext *context = umem->context;
  196. struct mm_struct *mm;
  197. unsigned long diff;
  198. __ib_umem_release(umem->context->device, umem, 1);
  199. mm = get_task_mm(current);
  200. if (!mm) {
  201. kfree(umem);
  202. return;
  203. }
  204. diff = PAGE_ALIGN(umem->length + umem->offset) >> PAGE_SHIFT;
  205. /*
  206. * We may be called with the mm's mmap_sem already held. This
  207. * can happen when a userspace munmap() is the call that drops
  208. * the last reference to our file and calls our release
  209. * method. If there are memory regions to destroy, we'll end
  210. * up here and not be able to take the mmap_sem. In that case
  211. * we defer the vm_locked accounting to the system workqueue.
  212. */
  213. if (context->closing) {
  214. if (!down_write_trylock(&mm->mmap_sem)) {
  215. INIT_WORK(&umem->work, ib_umem_account);
  216. umem->mm = mm;
  217. umem->diff = diff;
  218. schedule_work(&umem->work);
  219. return;
  220. }
  221. } else
  222. down_write(&mm->mmap_sem);
  223. current->mm->locked_vm -= diff;
  224. up_write(&mm->mmap_sem);
  225. mmput(mm);
  226. kfree(umem);
  227. }
  228. EXPORT_SYMBOL(ib_umem_release);
  229. int ib_umem_page_count(struct ib_umem *umem)
  230. {
  231. struct ib_umem_chunk *chunk;
  232. int shift;
  233. int i;
  234. int n;
  235. shift = ilog2(umem->page_size);
  236. n = 0;
  237. list_for_each_entry(chunk, &umem->chunk_list, list)
  238. for (i = 0; i < chunk->nmap; ++i)
  239. n += sg_dma_len(&chunk->page_list[i]) >> shift;
  240. return n;
  241. }
  242. EXPORT_SYMBOL(ib_umem_page_count);