umem.c 6.8 KB

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