cq.c 8.5 KB

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