cq.c 8.6 KB

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