pd.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249
  1. /*
  2. * Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
  3. * Copyright (c) 2005 Mellanox Technologies. 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/init.h>
  34. #include <linux/errno.h>
  35. #include <linux/export.h>
  36. #include <linux/io-mapping.h>
  37. #include <asm/page.h>
  38. #include "mlx4.h"
  39. #include "icm.h"
  40. enum {
  41. MLX4_NUM_RESERVED_UARS = 8
  42. };
  43. int mlx4_pd_alloc(struct mlx4_dev *dev, u32 *pdn)
  44. {
  45. struct mlx4_priv *priv = mlx4_priv(dev);
  46. *pdn = mlx4_bitmap_alloc(&priv->pd_bitmap);
  47. if (*pdn == -1)
  48. return -ENOMEM;
  49. return 0;
  50. }
  51. EXPORT_SYMBOL_GPL(mlx4_pd_alloc);
  52. void mlx4_pd_free(struct mlx4_dev *dev, u32 pdn)
  53. {
  54. mlx4_bitmap_free(&mlx4_priv(dev)->pd_bitmap, pdn);
  55. }
  56. EXPORT_SYMBOL_GPL(mlx4_pd_free);
  57. int mlx4_xrcd_alloc(struct mlx4_dev *dev, u32 *xrcdn)
  58. {
  59. struct mlx4_priv *priv = mlx4_priv(dev);
  60. *xrcdn = mlx4_bitmap_alloc(&priv->xrcd_bitmap);
  61. if (*xrcdn == -1)
  62. return -ENOMEM;
  63. return 0;
  64. }
  65. EXPORT_SYMBOL_GPL(mlx4_xrcd_alloc);
  66. void mlx4_xrcd_free(struct mlx4_dev *dev, u32 xrcdn)
  67. {
  68. mlx4_bitmap_free(&mlx4_priv(dev)->xrcd_bitmap, xrcdn);
  69. }
  70. EXPORT_SYMBOL_GPL(mlx4_xrcd_free);
  71. int mlx4_init_pd_table(struct mlx4_dev *dev)
  72. {
  73. struct mlx4_priv *priv = mlx4_priv(dev);
  74. return mlx4_bitmap_init(&priv->pd_bitmap, dev->caps.num_pds,
  75. (1 << NOT_MASKED_PD_BITS) - 1,
  76. dev->caps.reserved_pds, 0);
  77. }
  78. void mlx4_cleanup_pd_table(struct mlx4_dev *dev)
  79. {
  80. mlx4_bitmap_cleanup(&mlx4_priv(dev)->pd_bitmap);
  81. }
  82. int mlx4_init_xrcd_table(struct mlx4_dev *dev)
  83. {
  84. struct mlx4_priv *priv = mlx4_priv(dev);
  85. return mlx4_bitmap_init(&priv->xrcd_bitmap, (1 << 16),
  86. (1 << 16) - 1, dev->caps.reserved_xrcds + 1, 0);
  87. }
  88. void mlx4_cleanup_xrcd_table(struct mlx4_dev *dev)
  89. {
  90. mlx4_bitmap_cleanup(&mlx4_priv(dev)->xrcd_bitmap);
  91. }
  92. int mlx4_uar_alloc(struct mlx4_dev *dev, struct mlx4_uar *uar)
  93. {
  94. int offset;
  95. uar->index = mlx4_bitmap_alloc(&mlx4_priv(dev)->uar_table.bitmap);
  96. if (uar->index == -1)
  97. return -ENOMEM;
  98. if (mlx4_is_slave(dev))
  99. offset = uar->index % ((int) pci_resource_len(dev->pdev, 2) /
  100. dev->caps.uar_page_size);
  101. else
  102. offset = uar->index;
  103. uar->pfn = (pci_resource_start(dev->pdev, 2) >> PAGE_SHIFT) + offset;
  104. uar->map = NULL;
  105. return 0;
  106. }
  107. EXPORT_SYMBOL_GPL(mlx4_uar_alloc);
  108. void mlx4_uar_free(struct mlx4_dev *dev, struct mlx4_uar *uar)
  109. {
  110. mlx4_bitmap_free(&mlx4_priv(dev)->uar_table.bitmap, uar->index);
  111. }
  112. EXPORT_SYMBOL_GPL(mlx4_uar_free);
  113. int mlx4_bf_alloc(struct mlx4_dev *dev, struct mlx4_bf *bf)
  114. {
  115. struct mlx4_priv *priv = mlx4_priv(dev);
  116. struct mlx4_uar *uar;
  117. int err = 0;
  118. int idx;
  119. if (!priv->bf_mapping)
  120. return -ENOMEM;
  121. mutex_lock(&priv->bf_mutex);
  122. if (!list_empty(&priv->bf_list))
  123. uar = list_entry(priv->bf_list.next, struct mlx4_uar, bf_list);
  124. else {
  125. if (mlx4_bitmap_avail(&priv->uar_table.bitmap) < MLX4_NUM_RESERVED_UARS) {
  126. err = -ENOMEM;
  127. goto out;
  128. }
  129. uar = kmalloc(sizeof *uar, GFP_KERNEL);
  130. if (!uar) {
  131. err = -ENOMEM;
  132. goto out;
  133. }
  134. err = mlx4_uar_alloc(dev, uar);
  135. if (err)
  136. goto free_kmalloc;
  137. uar->map = ioremap(uar->pfn << PAGE_SHIFT, PAGE_SIZE);
  138. if (!uar->map) {
  139. err = -ENOMEM;
  140. goto free_uar;
  141. }
  142. uar->bf_map = io_mapping_map_wc(priv->bf_mapping, uar->index << PAGE_SHIFT);
  143. if (!uar->bf_map) {
  144. err = -ENOMEM;
  145. goto unamp_uar;
  146. }
  147. uar->free_bf_bmap = 0;
  148. list_add(&uar->bf_list, &priv->bf_list);
  149. }
  150. bf->uar = uar;
  151. idx = ffz(uar->free_bf_bmap);
  152. uar->free_bf_bmap |= 1 << idx;
  153. bf->uar = uar;
  154. bf->offset = 0;
  155. bf->buf_size = dev->caps.bf_reg_size / 2;
  156. bf->reg = uar->bf_map + idx * dev->caps.bf_reg_size;
  157. if (uar->free_bf_bmap == (1 << dev->caps.bf_regs_per_page) - 1)
  158. list_del_init(&uar->bf_list);
  159. goto out;
  160. unamp_uar:
  161. bf->uar = NULL;
  162. iounmap(uar->map);
  163. free_uar:
  164. mlx4_uar_free(dev, uar);
  165. free_kmalloc:
  166. kfree(uar);
  167. out:
  168. mutex_unlock(&priv->bf_mutex);
  169. return err;
  170. }
  171. EXPORT_SYMBOL_GPL(mlx4_bf_alloc);
  172. void mlx4_bf_free(struct mlx4_dev *dev, struct mlx4_bf *bf)
  173. {
  174. struct mlx4_priv *priv = mlx4_priv(dev);
  175. int idx;
  176. if (!bf->uar || !bf->uar->bf_map)
  177. return;
  178. mutex_lock(&priv->bf_mutex);
  179. idx = (bf->reg - bf->uar->bf_map) / dev->caps.bf_reg_size;
  180. bf->uar->free_bf_bmap &= ~(1 << idx);
  181. if (!bf->uar->free_bf_bmap) {
  182. if (!list_empty(&bf->uar->bf_list))
  183. list_del(&bf->uar->bf_list);
  184. io_mapping_unmap(bf->uar->bf_map);
  185. iounmap(bf->uar->map);
  186. mlx4_uar_free(dev, bf->uar);
  187. kfree(bf->uar);
  188. } else if (list_empty(&bf->uar->bf_list))
  189. list_add(&bf->uar->bf_list, &priv->bf_list);
  190. mutex_unlock(&priv->bf_mutex);
  191. }
  192. EXPORT_SYMBOL_GPL(mlx4_bf_free);
  193. int mlx4_init_uar_table(struct mlx4_dev *dev)
  194. {
  195. if (dev->caps.num_uars <= 128) {
  196. mlx4_err(dev, "Only %d UAR pages (need more than 128)\n",
  197. dev->caps.num_uars);
  198. mlx4_err(dev, "Increase firmware log2_uar_bar_megabytes?\n");
  199. return -ENODEV;
  200. }
  201. return mlx4_bitmap_init(&mlx4_priv(dev)->uar_table.bitmap,
  202. dev->caps.num_uars, dev->caps.num_uars - 1,
  203. dev->caps.reserved_uars, 0);
  204. }
  205. void mlx4_cleanup_uar_table(struct mlx4_dev *dev)
  206. {
  207. mlx4_bitmap_cleanup(&mlx4_priv(dev)->uar_table.bitmap);
  208. }