mem.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247
  1. /*
  2. * Copyright (c) 2013-2015, Mellanox Technologies. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include <linux/module.h>
  33. #include <rdma/ib_umem.h>
  34. #include <rdma/ib_umem_odp.h>
  35. #include "mlx5_ib.h"
  36. /* @umem: umem object to scan
  37. * @addr: ib virtual address requested by the user
  38. * @max_page_shift: high limit for page_shift - 0 means no limit
  39. * @count: number of PAGE_SIZE pages covered by umem
  40. * @shift: page shift for the compound pages found in the region
  41. * @ncont: number of compund pages
  42. * @order: log2 of the number of compound pages
  43. */
  44. void mlx5_ib_cont_pages(struct ib_umem *umem, u64 addr,
  45. unsigned long max_page_shift,
  46. int *count, int *shift,
  47. int *ncont, int *order)
  48. {
  49. unsigned long tmp;
  50. unsigned long m;
  51. int i, k;
  52. u64 base = 0;
  53. int p = 0;
  54. int skip;
  55. int mask;
  56. u64 len;
  57. u64 pfn;
  58. struct scatterlist *sg;
  59. int entry;
  60. unsigned long page_shift = umem->page_shift;
  61. if (umem->odp_data) {
  62. *ncont = ib_umem_page_count(umem);
  63. *count = *ncont << (page_shift - PAGE_SHIFT);
  64. *shift = page_shift;
  65. if (order)
  66. *order = ilog2(roundup_pow_of_two(*ncont));
  67. return;
  68. }
  69. addr = addr >> page_shift;
  70. tmp = (unsigned long)addr;
  71. m = find_first_bit(&tmp, BITS_PER_LONG);
  72. if (max_page_shift)
  73. m = min_t(unsigned long, max_page_shift - page_shift, m);
  74. skip = 1 << m;
  75. mask = skip - 1;
  76. i = 0;
  77. for_each_sg(umem->sg_head.sgl, sg, umem->nmap, entry) {
  78. len = sg_dma_len(sg) >> page_shift;
  79. pfn = sg_dma_address(sg) >> page_shift;
  80. for (k = 0; k < len; k++) {
  81. if (!(i & mask)) {
  82. tmp = (unsigned long)pfn;
  83. m = min_t(unsigned long, m, find_first_bit(&tmp, BITS_PER_LONG));
  84. skip = 1 << m;
  85. mask = skip - 1;
  86. base = pfn;
  87. p = 0;
  88. } else {
  89. if (base + p != pfn) {
  90. tmp = (unsigned long)p;
  91. m = find_first_bit(&tmp, BITS_PER_LONG);
  92. skip = 1 << m;
  93. mask = skip - 1;
  94. base = pfn;
  95. p = 0;
  96. }
  97. }
  98. p++;
  99. i++;
  100. }
  101. }
  102. if (i) {
  103. m = min_t(unsigned long, ilog2(roundup_pow_of_two(i)), m);
  104. if (order)
  105. *order = ilog2(roundup_pow_of_two(i) >> m);
  106. *ncont = DIV_ROUND_UP(i, (1 << m));
  107. } else {
  108. m = 0;
  109. if (order)
  110. *order = 0;
  111. *ncont = 0;
  112. }
  113. *shift = page_shift + m;
  114. *count = i;
  115. }
  116. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  117. static u64 umem_dma_to_mtt(dma_addr_t umem_dma)
  118. {
  119. u64 mtt_entry = umem_dma & ODP_DMA_ADDR_MASK;
  120. if (umem_dma & ODP_READ_ALLOWED_BIT)
  121. mtt_entry |= MLX5_IB_MTT_READ;
  122. if (umem_dma & ODP_WRITE_ALLOWED_BIT)
  123. mtt_entry |= MLX5_IB_MTT_WRITE;
  124. return mtt_entry;
  125. }
  126. #endif
  127. /*
  128. * Populate the given array with bus addresses from the umem.
  129. *
  130. * dev - mlx5_ib device
  131. * umem - umem to use to fill the pages
  132. * page_shift - determines the page size used in the resulting array
  133. * offset - offset into the umem to start from,
  134. * only implemented for ODP umems
  135. * num_pages - total number of pages to fill
  136. * pas - bus addresses array to fill
  137. * access_flags - access flags to set on all present pages.
  138. use enum mlx5_ib_mtt_access_flags for this.
  139. */
  140. void __mlx5_ib_populate_pas(struct mlx5_ib_dev *dev, struct ib_umem *umem,
  141. int page_shift, size_t offset, size_t num_pages,
  142. __be64 *pas, int access_flags)
  143. {
  144. unsigned long umem_page_shift = umem->page_shift;
  145. int shift = page_shift - umem_page_shift;
  146. int mask = (1 << shift) - 1;
  147. int i, k, idx;
  148. u64 cur = 0;
  149. u64 base;
  150. int len;
  151. struct scatterlist *sg;
  152. int entry;
  153. #ifdef CONFIG_INFINIBAND_ON_DEMAND_PAGING
  154. const bool odp = umem->odp_data != NULL;
  155. if (odp) {
  156. WARN_ON(shift != 0);
  157. WARN_ON(access_flags != (MLX5_IB_MTT_READ | MLX5_IB_MTT_WRITE));
  158. for (i = 0; i < num_pages; ++i) {
  159. dma_addr_t pa = umem->odp_data->dma_list[offset + i];
  160. pas[i] = cpu_to_be64(umem_dma_to_mtt(pa));
  161. }
  162. return;
  163. }
  164. #endif
  165. i = 0;
  166. for_each_sg(umem->sg_head.sgl, sg, umem->nmap, entry) {
  167. len = sg_dma_len(sg) >> umem_page_shift;
  168. base = sg_dma_address(sg);
  169. /* Skip elements below offset */
  170. if (i + len < offset << shift) {
  171. i += len;
  172. continue;
  173. }
  174. /* Skip pages below offset */
  175. if (i < offset << shift) {
  176. k = (offset << shift) - i;
  177. i = offset << shift;
  178. } else {
  179. k = 0;
  180. }
  181. for (; k < len; k++) {
  182. if (!(i & mask)) {
  183. cur = base + (k << umem_page_shift);
  184. cur |= access_flags;
  185. idx = (i >> shift) - offset;
  186. pas[idx] = cpu_to_be64(cur);
  187. mlx5_ib_dbg(dev, "pas[%d] 0x%llx\n",
  188. i >> shift, be64_to_cpu(pas[idx]));
  189. }
  190. i++;
  191. /* Stop after num_pages reached */
  192. if (i >> shift >= offset + num_pages)
  193. return;
  194. }
  195. }
  196. }
  197. void mlx5_ib_populate_pas(struct mlx5_ib_dev *dev, struct ib_umem *umem,
  198. int page_shift, __be64 *pas, int access_flags)
  199. {
  200. return __mlx5_ib_populate_pas(dev, umem, page_shift, 0,
  201. ib_umem_num_pages(umem), pas,
  202. access_flags);
  203. }
  204. int mlx5_ib_get_buf_offset(u64 addr, int page_shift, u32 *offset)
  205. {
  206. u64 page_size;
  207. u64 page_mask;
  208. u64 off_size;
  209. u64 off_mask;
  210. u64 buf_off;
  211. page_size = (u64)1 << page_shift;
  212. page_mask = page_size - 1;
  213. buf_off = addr & page_mask;
  214. off_size = page_size >> 6;
  215. off_mask = off_size - 1;
  216. if (buf_off & off_mask)
  217. return -EINVAL;
  218. *offset = buf_off >> ilog2(off_size);
  219. return 0;
  220. }