pd.c 6.3 KB

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