cq.c 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362
  1. /*
  2. * Copyright (c) 2004, 2005 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Sun Microsystems, Inc. All rights reserved.
  4. * Copyright (c) 2005, 2006, 2007 Cisco Systems, Inc. All rights reserved.
  5. * Copyright (c) 2005, 2006, 2007, 2008 Mellanox Technologies. All rights reserved.
  6. * Copyright (c) 2004 Voltaire, Inc. All rights reserved.
  7. *
  8. * This software is available to you under a choice of one of two
  9. * licenses. You may choose to be licensed under the terms of the GNU
  10. * General Public License (GPL) Version 2, available from the file
  11. * COPYING in the main directory of this source tree, or the
  12. * OpenIB.org BSD license below:
  13. *
  14. * Redistribution and use in source and binary forms, with or
  15. * without modification, are permitted provided that the following
  16. * conditions are met:
  17. *
  18. * - Redistributions of source code must retain the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer.
  21. *
  22. * - Redistributions in binary form must reproduce the above
  23. * copyright notice, this list of conditions and the following
  24. * disclaimer in the documentation and/or other materials
  25. * provided with the distribution.
  26. *
  27. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  28. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  29. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  30. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  31. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  32. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  33. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  34. * SOFTWARE.
  35. */
  36. #include <linux/init.h>
  37. #include <linux/hardirq.h>
  38. #include <linux/export.h>
  39. #include <linux/mlx4/cmd.h>
  40. #include <linux/mlx4/cq.h>
  41. #include "mlx4.h"
  42. #include "icm.h"
  43. #define MLX4_CQ_STATUS_OK ( 0 << 28)
  44. #define MLX4_CQ_STATUS_OVERFLOW ( 9 << 28)
  45. #define MLX4_CQ_STATUS_WRITE_FAIL (10 << 28)
  46. #define MLX4_CQ_FLAG_CC ( 1 << 18)
  47. #define MLX4_CQ_FLAG_OI ( 1 << 17)
  48. #define MLX4_CQ_STATE_ARMED ( 9 << 8)
  49. #define MLX4_CQ_STATE_ARMED_SOL ( 6 << 8)
  50. #define MLX4_EQ_STATE_FIRED (10 << 8)
  51. void mlx4_cq_completion(struct mlx4_dev *dev, u32 cqn)
  52. {
  53. struct mlx4_cq *cq;
  54. cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree,
  55. cqn & (dev->caps.num_cqs - 1));
  56. if (!cq) {
  57. mlx4_dbg(dev, "Completion event for bogus CQ %08x\n", cqn);
  58. return;
  59. }
  60. ++cq->arm_sn;
  61. cq->comp(cq);
  62. }
  63. void mlx4_cq_event(struct mlx4_dev *dev, u32 cqn, int event_type)
  64. {
  65. struct mlx4_cq_table *cq_table = &mlx4_priv(dev)->cq_table;
  66. struct mlx4_cq *cq;
  67. spin_lock(&cq_table->lock);
  68. cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1));
  69. if (cq)
  70. atomic_inc(&cq->refcount);
  71. spin_unlock(&cq_table->lock);
  72. if (!cq) {
  73. mlx4_warn(dev, "Async event for bogus CQ %08x\n", cqn);
  74. return;
  75. }
  76. cq->event(cq, event_type);
  77. if (atomic_dec_and_test(&cq->refcount))
  78. complete(&cq->free);
  79. }
  80. static int mlx4_SW2HW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  81. int cq_num)
  82. {
  83. return mlx4_cmd(dev, mailbox->dma, cq_num, 0,
  84. MLX4_CMD_SW2HW_CQ, MLX4_CMD_TIME_CLASS_A,
  85. MLX4_CMD_WRAPPED);
  86. }
  87. static int mlx4_MODIFY_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  88. int cq_num, u32 opmod)
  89. {
  90. return mlx4_cmd(dev, mailbox->dma, cq_num, opmod, MLX4_CMD_MODIFY_CQ,
  91. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  92. }
  93. static int mlx4_HW2SW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  94. int cq_num)
  95. {
  96. return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0,
  97. cq_num, mailbox ? 0 : 1, MLX4_CMD_HW2SW_CQ,
  98. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  99. }
  100. int mlx4_cq_modify(struct mlx4_dev *dev, struct mlx4_cq *cq,
  101. u16 count, u16 period)
  102. {
  103. struct mlx4_cmd_mailbox *mailbox;
  104. struct mlx4_cq_context *cq_context;
  105. int err;
  106. mailbox = mlx4_alloc_cmd_mailbox(dev);
  107. if (IS_ERR(mailbox))
  108. return PTR_ERR(mailbox);
  109. cq_context = mailbox->buf;
  110. memset(cq_context, 0, sizeof *cq_context);
  111. cq_context->cq_max_count = cpu_to_be16(count);
  112. cq_context->cq_period = cpu_to_be16(period);
  113. err = mlx4_MODIFY_CQ(dev, mailbox, cq->cqn, 1);
  114. mlx4_free_cmd_mailbox(dev, mailbox);
  115. return err;
  116. }
  117. EXPORT_SYMBOL_GPL(mlx4_cq_modify);
  118. int mlx4_cq_resize(struct mlx4_dev *dev, struct mlx4_cq *cq,
  119. int entries, struct mlx4_mtt *mtt)
  120. {
  121. struct mlx4_cmd_mailbox *mailbox;
  122. struct mlx4_cq_context *cq_context;
  123. u64 mtt_addr;
  124. int err;
  125. mailbox = mlx4_alloc_cmd_mailbox(dev);
  126. if (IS_ERR(mailbox))
  127. return PTR_ERR(mailbox);
  128. cq_context = mailbox->buf;
  129. memset(cq_context, 0, sizeof *cq_context);
  130. cq_context->logsize_usrpage = cpu_to_be32(ilog2(entries) << 24);
  131. cq_context->log_page_size = mtt->page_shift - 12;
  132. mtt_addr = mlx4_mtt_addr(dev, mtt);
  133. cq_context->mtt_base_addr_h = mtt_addr >> 32;
  134. cq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  135. err = mlx4_MODIFY_CQ(dev, mailbox, cq->cqn, 0);
  136. mlx4_free_cmd_mailbox(dev, mailbox);
  137. return err;
  138. }
  139. EXPORT_SYMBOL_GPL(mlx4_cq_resize);
  140. int __mlx4_cq_alloc_icm(struct mlx4_dev *dev, int *cqn)
  141. {
  142. struct mlx4_priv *priv = mlx4_priv(dev);
  143. struct mlx4_cq_table *cq_table = &priv->cq_table;
  144. int err;
  145. *cqn = mlx4_bitmap_alloc(&cq_table->bitmap);
  146. if (*cqn == -1)
  147. return -ENOMEM;
  148. err = mlx4_table_get(dev, &cq_table->table, *cqn);
  149. if (err)
  150. goto err_out;
  151. err = mlx4_table_get(dev, &cq_table->cmpt_table, *cqn);
  152. if (err)
  153. goto err_put;
  154. return 0;
  155. err_put:
  156. mlx4_table_put(dev, &cq_table->table, *cqn);
  157. err_out:
  158. mlx4_bitmap_free(&cq_table->bitmap, *cqn);
  159. return err;
  160. }
  161. static int mlx4_cq_alloc_icm(struct mlx4_dev *dev, int *cqn)
  162. {
  163. u64 out_param;
  164. int err;
  165. if (mlx4_is_mfunc(dev)) {
  166. err = mlx4_cmd_imm(dev, 0, &out_param, RES_CQ,
  167. RES_OP_RESERVE_AND_MAP, MLX4_CMD_ALLOC_RES,
  168. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  169. if (err)
  170. return err;
  171. else {
  172. *cqn = get_param_l(&out_param);
  173. return 0;
  174. }
  175. }
  176. return __mlx4_cq_alloc_icm(dev, cqn);
  177. }
  178. void __mlx4_cq_free_icm(struct mlx4_dev *dev, int cqn)
  179. {
  180. struct mlx4_priv *priv = mlx4_priv(dev);
  181. struct mlx4_cq_table *cq_table = &priv->cq_table;
  182. mlx4_table_put(dev, &cq_table->cmpt_table, cqn);
  183. mlx4_table_put(dev, &cq_table->table, cqn);
  184. mlx4_bitmap_free(&cq_table->bitmap, cqn);
  185. }
  186. static void mlx4_cq_free_icm(struct mlx4_dev *dev, int cqn)
  187. {
  188. u64 in_param;
  189. int err;
  190. if (mlx4_is_mfunc(dev)) {
  191. set_param_l(&in_param, cqn);
  192. err = mlx4_cmd(dev, in_param, RES_CQ, RES_OP_RESERVE_AND_MAP,
  193. MLX4_CMD_FREE_RES,
  194. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  195. if (err)
  196. mlx4_warn(dev, "Failed freeing cq:%d\n", cqn);
  197. } else
  198. __mlx4_cq_free_icm(dev, cqn);
  199. }
  200. int mlx4_cq_alloc(struct mlx4_dev *dev, int nent, struct mlx4_mtt *mtt,
  201. struct mlx4_uar *uar, u64 db_rec, struct mlx4_cq *cq,
  202. unsigned vector, int collapsed)
  203. {
  204. struct mlx4_priv *priv = mlx4_priv(dev);
  205. struct mlx4_cq_table *cq_table = &priv->cq_table;
  206. struct mlx4_cmd_mailbox *mailbox;
  207. struct mlx4_cq_context *cq_context;
  208. u64 mtt_addr;
  209. int err;
  210. if (vector > dev->caps.num_comp_vectors + dev->caps.comp_pool)
  211. return -EINVAL;
  212. cq->vector = vector;
  213. err = mlx4_cq_alloc_icm(dev, &cq->cqn);
  214. if (err)
  215. return err;
  216. spin_lock_irq(&cq_table->lock);
  217. err = radix_tree_insert(&cq_table->tree, cq->cqn, cq);
  218. spin_unlock_irq(&cq_table->lock);
  219. if (err)
  220. goto err_icm;
  221. mailbox = mlx4_alloc_cmd_mailbox(dev);
  222. if (IS_ERR(mailbox)) {
  223. err = PTR_ERR(mailbox);
  224. goto err_radix;
  225. }
  226. cq_context = mailbox->buf;
  227. memset(cq_context, 0, sizeof *cq_context);
  228. cq_context->flags = cpu_to_be32(!!collapsed << 18);
  229. cq_context->logsize_usrpage = cpu_to_be32((ilog2(nent) << 24) | uar->index);
  230. cq_context->comp_eqn = priv->eq_table.eq[vector].eqn;
  231. cq_context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
  232. mtt_addr = mlx4_mtt_addr(dev, mtt);
  233. cq_context->mtt_base_addr_h = mtt_addr >> 32;
  234. cq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  235. cq_context->db_rec_addr = cpu_to_be64(db_rec);
  236. err = mlx4_SW2HW_CQ(dev, mailbox, cq->cqn);
  237. mlx4_free_cmd_mailbox(dev, mailbox);
  238. if (err)
  239. goto err_radix;
  240. cq->cons_index = 0;
  241. cq->arm_sn = 1;
  242. cq->uar = uar;
  243. atomic_set(&cq->refcount, 1);
  244. init_completion(&cq->free);
  245. return 0;
  246. err_radix:
  247. spin_lock_irq(&cq_table->lock);
  248. radix_tree_delete(&cq_table->tree, cq->cqn);
  249. spin_unlock_irq(&cq_table->lock);
  250. err_icm:
  251. mlx4_cq_free_icm(dev, cq->cqn);
  252. return err;
  253. }
  254. EXPORT_SYMBOL_GPL(mlx4_cq_alloc);
  255. void mlx4_cq_free(struct mlx4_dev *dev, struct mlx4_cq *cq)
  256. {
  257. struct mlx4_priv *priv = mlx4_priv(dev);
  258. struct mlx4_cq_table *cq_table = &priv->cq_table;
  259. int err;
  260. err = mlx4_HW2SW_CQ(dev, NULL, cq->cqn);
  261. if (err)
  262. mlx4_warn(dev, "HW2SW_CQ failed (%d) for CQN %06x\n", err, cq->cqn);
  263. synchronize_irq(priv->eq_table.eq[cq->vector].irq);
  264. spin_lock_irq(&cq_table->lock);
  265. radix_tree_delete(&cq_table->tree, cq->cqn);
  266. spin_unlock_irq(&cq_table->lock);
  267. if (atomic_dec_and_test(&cq->refcount))
  268. complete(&cq->free);
  269. wait_for_completion(&cq->free);
  270. mlx4_cq_free_icm(dev, cq->cqn);
  271. }
  272. EXPORT_SYMBOL_GPL(mlx4_cq_free);
  273. int mlx4_init_cq_table(struct mlx4_dev *dev)
  274. {
  275. struct mlx4_cq_table *cq_table = &mlx4_priv(dev)->cq_table;
  276. int err;
  277. spin_lock_init(&cq_table->lock);
  278. INIT_RADIX_TREE(&cq_table->tree, GFP_ATOMIC);
  279. if (mlx4_is_slave(dev))
  280. return 0;
  281. err = mlx4_bitmap_init(&cq_table->bitmap, dev->caps.num_cqs,
  282. dev->caps.num_cqs - 1, dev->caps.reserved_cqs, 0);
  283. if (err)
  284. return err;
  285. return 0;
  286. }
  287. void mlx4_cleanup_cq_table(struct mlx4_dev *dev)
  288. {
  289. if (mlx4_is_slave(dev))
  290. return;
  291. /* Nothing to do to clean up radix_tree */
  292. mlx4_bitmap_cleanup(&mlx4_priv(dev)->cq_table.bitmap);
  293. }