umem.c 7.1 KB

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