qib_user_pages.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163
  1. /*
  2. * Copyright (c) 2006, 2007, 2008, 2009 QLogic Corporation. All rights reserved.
  3. * Copyright (c) 2003, 2004, 2005, 2006 PathScale, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/mm.h>
  34. #include <linux/sched/signal.h>
  35. #include <linux/device.h>
  36. #include "qib.h"
  37. static void __qib_release_user_pages(struct page **p, size_t num_pages,
  38. int dirty)
  39. {
  40. size_t i;
  41. for (i = 0; i < num_pages; i++) {
  42. if (dirty)
  43. set_page_dirty_lock(p[i]);
  44. put_page(p[i]);
  45. }
  46. }
  47. /*
  48. * Call with current->mm->mmap_sem held.
  49. */
  50. static int __qib_get_user_pages(unsigned long start_page, size_t num_pages,
  51. struct page **p)
  52. {
  53. unsigned long lock_limit;
  54. size_t got;
  55. int ret;
  56. lock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
  57. if (num_pages > lock_limit && !capable(CAP_IPC_LOCK)) {
  58. ret = -ENOMEM;
  59. goto bail;
  60. }
  61. for (got = 0; got < num_pages; got += ret) {
  62. ret = get_user_pages(start_page + got * PAGE_SIZE,
  63. num_pages - got,
  64. FOLL_WRITE | FOLL_FORCE,
  65. p + got, NULL);
  66. if (ret < 0)
  67. goto bail_release;
  68. }
  69. current->mm->pinned_vm += num_pages;
  70. ret = 0;
  71. goto bail;
  72. bail_release:
  73. __qib_release_user_pages(p, got, 0);
  74. bail:
  75. return ret;
  76. }
  77. /**
  78. * qib_map_page - a safety wrapper around pci_map_page()
  79. *
  80. * A dma_addr of all 0's is interpreted by the chip as "disabled".
  81. * Unfortunately, it can also be a valid dma_addr returned on some
  82. * architectures.
  83. *
  84. * The powerpc iommu assigns dma_addrs in ascending order, so we don't
  85. * have to bother with retries or mapping a dummy page to insure we
  86. * don't just get the same mapping again.
  87. *
  88. * I'm sure we won't be so lucky with other iommu's, so FIXME.
  89. */
  90. int qib_map_page(struct pci_dev *hwdev, struct page *page, dma_addr_t *daddr)
  91. {
  92. dma_addr_t phys;
  93. phys = pci_map_page(hwdev, page, 0, PAGE_SIZE, PCI_DMA_FROMDEVICE);
  94. if (pci_dma_mapping_error(hwdev, phys))
  95. return -ENOMEM;
  96. if (!phys) {
  97. pci_unmap_page(hwdev, phys, PAGE_SIZE, PCI_DMA_FROMDEVICE);
  98. phys = pci_map_page(hwdev, page, 0, PAGE_SIZE,
  99. PCI_DMA_FROMDEVICE);
  100. if (pci_dma_mapping_error(hwdev, phys))
  101. return -ENOMEM;
  102. /*
  103. * FIXME: If we get 0 again, we should keep this page,
  104. * map another, then free the 0 page.
  105. */
  106. }
  107. *daddr = phys;
  108. return 0;
  109. }
  110. /**
  111. * qib_get_user_pages - lock user pages into memory
  112. * @start_page: the start page
  113. * @num_pages: the number of pages
  114. * @p: the output page structures
  115. *
  116. * This function takes a given start page (page aligned user virtual
  117. * address) and pins it and the following specified number of pages. For
  118. * now, num_pages is always 1, but that will probably change at some point
  119. * (because caller is doing expected sends on a single virtually contiguous
  120. * buffer, so we can do all pages at once).
  121. */
  122. int qib_get_user_pages(unsigned long start_page, size_t num_pages,
  123. struct page **p)
  124. {
  125. int ret;
  126. down_write(&current->mm->mmap_sem);
  127. ret = __qib_get_user_pages(start_page, num_pages, p);
  128. up_write(&current->mm->mmap_sem);
  129. return ret;
  130. }
  131. void qib_release_user_pages(struct page **p, size_t num_pages)
  132. {
  133. if (current->mm) /* during close after signal, mm can be NULL */
  134. down_write(&current->mm->mmap_sem);
  135. __qib_release_user_pages(p, num_pages, 1);
  136. if (current->mm) {
  137. current->mm->pinned_vm -= num_pages;
  138. up_write(&current->mm->mmap_sem);
  139. }
  140. }