cq.c 9.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359
  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/hardirq.h>
  37. #include <linux/export.h>
  38. #include <linux/mlx4/cmd.h>
  39. #include <linux/mlx4/cq.h>
  40. #include "mlx4.h"
  41. #include "icm.h"
  42. #define MLX4_CQ_STATUS_OK ( 0 << 28)
  43. #define MLX4_CQ_STATUS_OVERFLOW ( 9 << 28)
  44. #define MLX4_CQ_STATUS_WRITE_FAIL (10 << 28)
  45. #define MLX4_CQ_FLAG_CC ( 1 << 18)
  46. #define MLX4_CQ_FLAG_OI ( 1 << 17)
  47. #define MLX4_CQ_STATE_ARMED ( 9 << 8)
  48. #define MLX4_CQ_STATE_ARMED_SOL ( 6 << 8)
  49. #define MLX4_EQ_STATE_FIRED (10 << 8)
  50. void mlx4_cq_completion(struct mlx4_dev *dev, u32 cqn)
  51. {
  52. struct mlx4_cq *cq;
  53. cq = radix_tree_lookup(&mlx4_priv(dev)->cq_table.tree,
  54. cqn & (dev->caps.num_cqs - 1));
  55. if (!cq) {
  56. mlx4_dbg(dev, "Completion event for bogus CQ %08x\n", cqn);
  57. return;
  58. }
  59. ++cq->arm_sn;
  60. cq->comp(cq);
  61. }
  62. void mlx4_cq_event(struct mlx4_dev *dev, u32 cqn, int event_type)
  63. {
  64. struct mlx4_cq_table *cq_table = &mlx4_priv(dev)->cq_table;
  65. struct mlx4_cq *cq;
  66. spin_lock(&cq_table->lock);
  67. cq = radix_tree_lookup(&cq_table->tree, cqn & (dev->caps.num_cqs - 1));
  68. if (cq)
  69. atomic_inc(&cq->refcount);
  70. spin_unlock(&cq_table->lock);
  71. if (!cq) {
  72. mlx4_warn(dev, "Async event for bogus CQ %08x\n", cqn);
  73. return;
  74. }
  75. cq->event(cq, event_type);
  76. if (atomic_dec_and_test(&cq->refcount))
  77. complete(&cq->free);
  78. }
  79. static int mlx4_SW2HW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  80. int cq_num)
  81. {
  82. return mlx4_cmd(dev, mailbox->dma, cq_num, 0,
  83. MLX4_CMD_SW2HW_CQ, MLX4_CMD_TIME_CLASS_A,
  84. MLX4_CMD_WRAPPED);
  85. }
  86. static int mlx4_MODIFY_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  87. int cq_num, u32 opmod)
  88. {
  89. return mlx4_cmd(dev, mailbox->dma, cq_num, opmod, MLX4_CMD_MODIFY_CQ,
  90. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  91. }
  92. static int mlx4_HW2SW_CQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  93. int cq_num)
  94. {
  95. return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0,
  96. cq_num, mailbox ? 0 : 1, MLX4_CMD_HW2SW_CQ,
  97. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  98. }
  99. int mlx4_cq_modify(struct mlx4_dev *dev, struct mlx4_cq *cq,
  100. u16 count, u16 period)
  101. {
  102. struct mlx4_cmd_mailbox *mailbox;
  103. struct mlx4_cq_context *cq_context;
  104. int err;
  105. mailbox = mlx4_alloc_cmd_mailbox(dev);
  106. if (IS_ERR(mailbox))
  107. return PTR_ERR(mailbox);
  108. cq_context = mailbox->buf;
  109. cq_context->cq_max_count = cpu_to_be16(count);
  110. cq_context->cq_period = cpu_to_be16(period);
  111. err = mlx4_MODIFY_CQ(dev, mailbox, cq->cqn, 1);
  112. mlx4_free_cmd_mailbox(dev, mailbox);
  113. return err;
  114. }
  115. EXPORT_SYMBOL_GPL(mlx4_cq_modify);
  116. int mlx4_cq_resize(struct mlx4_dev *dev, struct mlx4_cq *cq,
  117. int entries, struct mlx4_mtt *mtt)
  118. {
  119. struct mlx4_cmd_mailbox *mailbox;
  120. struct mlx4_cq_context *cq_context;
  121. u64 mtt_addr;
  122. int err;
  123. mailbox = mlx4_alloc_cmd_mailbox(dev);
  124. if (IS_ERR(mailbox))
  125. return PTR_ERR(mailbox);
  126. cq_context = mailbox->buf;
  127. cq_context->logsize_usrpage = cpu_to_be32(ilog2(entries) << 24);
  128. cq_context->log_page_size = mtt->page_shift - 12;
  129. mtt_addr = mlx4_mtt_addr(dev, mtt);
  130. cq_context->mtt_base_addr_h = mtt_addr >> 32;
  131. cq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  132. err = mlx4_MODIFY_CQ(dev, mailbox, cq->cqn, 0);
  133. mlx4_free_cmd_mailbox(dev, mailbox);
  134. return err;
  135. }
  136. EXPORT_SYMBOL_GPL(mlx4_cq_resize);
  137. int __mlx4_cq_alloc_icm(struct mlx4_dev *dev, int *cqn)
  138. {
  139. struct mlx4_priv *priv = mlx4_priv(dev);
  140. struct mlx4_cq_table *cq_table = &priv->cq_table;
  141. int err;
  142. *cqn = mlx4_bitmap_alloc(&cq_table->bitmap);
  143. if (*cqn == -1)
  144. return -ENOMEM;
  145. err = mlx4_table_get(dev, &cq_table->table, *cqn, GFP_KERNEL);
  146. if (err)
  147. goto err_out;
  148. err = mlx4_table_get(dev, &cq_table->cmpt_table, *cqn, GFP_KERNEL);
  149. if (err)
  150. goto err_put;
  151. return 0;
  152. err_put:
  153. mlx4_table_put(dev, &cq_table->table, *cqn);
  154. err_out:
  155. mlx4_bitmap_free(&cq_table->bitmap, *cqn, MLX4_NO_RR);
  156. return err;
  157. }
  158. static int mlx4_cq_alloc_icm(struct mlx4_dev *dev, int *cqn)
  159. {
  160. u64 out_param;
  161. int err;
  162. if (mlx4_is_mfunc(dev)) {
  163. err = mlx4_cmd_imm(dev, 0, &out_param, RES_CQ,
  164. RES_OP_RESERVE_AND_MAP, MLX4_CMD_ALLOC_RES,
  165. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  166. if (err)
  167. return err;
  168. else {
  169. *cqn = get_param_l(&out_param);
  170. return 0;
  171. }
  172. }
  173. return __mlx4_cq_alloc_icm(dev, cqn);
  174. }
  175. void __mlx4_cq_free_icm(struct mlx4_dev *dev, int cqn)
  176. {
  177. struct mlx4_priv *priv = mlx4_priv(dev);
  178. struct mlx4_cq_table *cq_table = &priv->cq_table;
  179. mlx4_table_put(dev, &cq_table->cmpt_table, cqn);
  180. mlx4_table_put(dev, &cq_table->table, cqn);
  181. mlx4_bitmap_free(&cq_table->bitmap, cqn, MLX4_NO_RR);
  182. }
  183. static void mlx4_cq_free_icm(struct mlx4_dev *dev, int cqn)
  184. {
  185. u64 in_param = 0;
  186. int err;
  187. if (mlx4_is_mfunc(dev)) {
  188. set_param_l(&in_param, cqn);
  189. err = mlx4_cmd(dev, in_param, RES_CQ, RES_OP_RESERVE_AND_MAP,
  190. MLX4_CMD_FREE_RES,
  191. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  192. if (err)
  193. mlx4_warn(dev, "Failed freeing cq:%d\n", cqn);
  194. } else
  195. __mlx4_cq_free_icm(dev, cqn);
  196. }
  197. int mlx4_cq_alloc(struct mlx4_dev *dev, int nent,
  198. struct mlx4_mtt *mtt, struct mlx4_uar *uar, u64 db_rec,
  199. struct mlx4_cq *cq, unsigned vector, int collapsed,
  200. int timestamp_en)
  201. {
  202. struct mlx4_priv *priv = mlx4_priv(dev);
  203. struct mlx4_cq_table *cq_table = &priv->cq_table;
  204. struct mlx4_cmd_mailbox *mailbox;
  205. struct mlx4_cq_context *cq_context;
  206. u64 mtt_addr;
  207. int err;
  208. if (vector > dev->caps.num_comp_vectors + dev->caps.comp_pool)
  209. return -EINVAL;
  210. cq->vector = vector;
  211. err = mlx4_cq_alloc_icm(dev, &cq->cqn);
  212. if (err)
  213. return err;
  214. spin_lock_irq(&cq_table->lock);
  215. err = radix_tree_insert(&cq_table->tree, cq->cqn, cq);
  216. spin_unlock_irq(&cq_table->lock);
  217. if (err)
  218. goto err_icm;
  219. mailbox = mlx4_alloc_cmd_mailbox(dev);
  220. if (IS_ERR(mailbox)) {
  221. err = PTR_ERR(mailbox);
  222. goto err_radix;
  223. }
  224. cq_context = mailbox->buf;
  225. cq_context->flags = cpu_to_be32(!!collapsed << 18);
  226. if (timestamp_en)
  227. cq_context->flags |= cpu_to_be32(1 << 19);
  228. cq_context->logsize_usrpage = cpu_to_be32((ilog2(nent) << 24) | uar->index);
  229. cq_context->comp_eqn = priv->eq_table.eq[vector].eqn;
  230. cq_context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
  231. mtt_addr = mlx4_mtt_addr(dev, mtt);
  232. cq_context->mtt_base_addr_h = mtt_addr >> 32;
  233. cq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  234. cq_context->db_rec_addr = cpu_to_be64(db_rec);
  235. err = mlx4_SW2HW_CQ(dev, mailbox, cq->cqn);
  236. mlx4_free_cmd_mailbox(dev, mailbox);
  237. if (err)
  238. goto err_radix;
  239. cq->cons_index = 0;
  240. cq->arm_sn = 1;
  241. cq->uar = uar;
  242. atomic_set(&cq->refcount, 1);
  243. init_completion(&cq->free);
  244. cq->irq = priv->eq_table.eq[cq->vector].irq;
  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. }