srq.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227
  1. /*
  2. * Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include <linux/init.h>
  33. #include <linux/mlx4/cmd.h>
  34. #include "mlx4.h"
  35. #include "icm.h"
  36. struct mlx4_srq_context {
  37. __be32 state_logsize_srqn;
  38. u8 logstride;
  39. u8 reserved1[3];
  40. u8 pg_offset;
  41. u8 reserved2[3];
  42. u32 reserved3;
  43. u8 log_page_size;
  44. u8 reserved4[2];
  45. u8 mtt_base_addr_h;
  46. __be32 mtt_base_addr_l;
  47. __be32 pd;
  48. __be16 limit_watermark;
  49. __be16 wqe_cnt;
  50. u16 reserved5;
  51. __be16 wqe_counter;
  52. u32 reserved6;
  53. __be64 db_rec_addr;
  54. };
  55. void mlx4_srq_event(struct mlx4_dev *dev, u32 srqn, int event_type)
  56. {
  57. struct mlx4_srq_table *srq_table = &mlx4_priv(dev)->srq_table;
  58. struct mlx4_srq *srq;
  59. spin_lock(&srq_table->lock);
  60. srq = radix_tree_lookup(&srq_table->tree, srqn & (dev->caps.num_srqs - 1));
  61. if (srq)
  62. atomic_inc(&srq->refcount);
  63. spin_unlock(&srq_table->lock);
  64. if (!srq) {
  65. mlx4_warn(dev, "Async event for bogus SRQ %08x\n", srqn);
  66. return;
  67. }
  68. srq->event(srq, event_type);
  69. if (atomic_dec_and_test(&srq->refcount))
  70. complete(&srq->free);
  71. }
  72. static int mlx4_SW2HW_SRQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  73. int srq_num)
  74. {
  75. return mlx4_cmd(dev, mailbox->dma, srq_num, 0, MLX4_CMD_SW2HW_SRQ,
  76. MLX4_CMD_TIME_CLASS_A);
  77. }
  78. static int mlx4_HW2SW_SRQ(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  79. int srq_num)
  80. {
  81. return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0, srq_num,
  82. mailbox ? 0 : 1, MLX4_CMD_HW2SW_SRQ,
  83. MLX4_CMD_TIME_CLASS_A);
  84. }
  85. static int mlx4_ARM_SRQ(struct mlx4_dev *dev, int srq_num, int limit_watermark)
  86. {
  87. return mlx4_cmd(dev, limit_watermark, srq_num, 0, MLX4_CMD_ARM_SRQ,
  88. MLX4_CMD_TIME_CLASS_B);
  89. }
  90. int mlx4_srq_alloc(struct mlx4_dev *dev, u32 pdn, struct mlx4_mtt *mtt,
  91. u64 db_rec, struct mlx4_srq *srq)
  92. {
  93. struct mlx4_srq_table *srq_table = &mlx4_priv(dev)->srq_table;
  94. struct mlx4_cmd_mailbox *mailbox;
  95. struct mlx4_srq_context *srq_context;
  96. u64 mtt_addr;
  97. int err;
  98. srq->srqn = mlx4_bitmap_alloc(&srq_table->bitmap);
  99. if (srq->srqn == -1)
  100. return -ENOMEM;
  101. err = mlx4_table_get(dev, &srq_table->table, srq->srqn);
  102. if (err)
  103. goto err_out;
  104. err = mlx4_table_get(dev, &srq_table->cmpt_table, srq->srqn);
  105. if (err)
  106. goto err_put;
  107. spin_lock_irq(&srq_table->lock);
  108. err = radix_tree_insert(&srq_table->tree, srq->srqn, srq);
  109. spin_unlock_irq(&srq_table->lock);
  110. if (err)
  111. goto err_cmpt_put;
  112. mailbox = mlx4_alloc_cmd_mailbox(dev);
  113. if (IS_ERR(mailbox)) {
  114. err = PTR_ERR(mailbox);
  115. goto err_radix;
  116. }
  117. srq_context = mailbox->buf;
  118. memset(srq_context, 0, sizeof *srq_context);
  119. srq_context->state_logsize_srqn = cpu_to_be32((ilog2(srq->max) << 24) |
  120. srq->srqn);
  121. srq_context->logstride = srq->wqe_shift - 4;
  122. srq_context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
  123. mtt_addr = mlx4_mtt_addr(dev, mtt);
  124. srq_context->mtt_base_addr_h = mtt_addr >> 32;
  125. srq_context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  126. srq_context->pd = cpu_to_be32(pdn);
  127. srq_context->db_rec_addr = cpu_to_be64(db_rec);
  128. err = mlx4_SW2HW_SRQ(dev, mailbox, srq->srqn);
  129. mlx4_free_cmd_mailbox(dev, mailbox);
  130. if (err)
  131. goto err_radix;
  132. atomic_set(&srq->refcount, 1);
  133. init_completion(&srq->free);
  134. return 0;
  135. err_radix:
  136. spin_lock_irq(&srq_table->lock);
  137. radix_tree_delete(&srq_table->tree, srq->srqn);
  138. spin_unlock_irq(&srq_table->lock);
  139. err_cmpt_put:
  140. mlx4_table_put(dev, &srq_table->cmpt_table, srq->srqn);
  141. err_put:
  142. mlx4_table_put(dev, &srq_table->table, srq->srqn);
  143. err_out:
  144. mlx4_bitmap_free(&srq_table->bitmap, srq->srqn);
  145. return err;
  146. }
  147. EXPORT_SYMBOL_GPL(mlx4_srq_alloc);
  148. void mlx4_srq_free(struct mlx4_dev *dev, struct mlx4_srq *srq)
  149. {
  150. struct mlx4_srq_table *srq_table = &mlx4_priv(dev)->srq_table;
  151. int err;
  152. err = mlx4_HW2SW_SRQ(dev, NULL, srq->srqn);
  153. if (err)
  154. mlx4_warn(dev, "HW2SW_SRQ failed (%d) for SRQN %06x\n", err, srq->srqn);
  155. spin_lock_irq(&srq_table->lock);
  156. radix_tree_delete(&srq_table->tree, srq->srqn);
  157. spin_unlock_irq(&srq_table->lock);
  158. if (atomic_dec_and_test(&srq->refcount))
  159. complete(&srq->free);
  160. wait_for_completion(&srq->free);
  161. mlx4_table_put(dev, &srq_table->table, srq->srqn);
  162. mlx4_bitmap_free(&srq_table->bitmap, srq->srqn);
  163. }
  164. EXPORT_SYMBOL_GPL(mlx4_srq_free);
  165. int mlx4_srq_arm(struct mlx4_dev *dev, struct mlx4_srq *srq, int limit_watermark)
  166. {
  167. return mlx4_ARM_SRQ(dev, srq->srqn, limit_watermark);
  168. }
  169. EXPORT_SYMBOL_GPL(mlx4_srq_arm);
  170. int __devinit mlx4_init_srq_table(struct mlx4_dev *dev)
  171. {
  172. struct mlx4_srq_table *srq_table = &mlx4_priv(dev)->srq_table;
  173. int err;
  174. spin_lock_init(&srq_table->lock);
  175. INIT_RADIX_TREE(&srq_table->tree, GFP_ATOMIC);
  176. err = mlx4_bitmap_init(&srq_table->bitmap, dev->caps.num_srqs,
  177. dev->caps.num_srqs - 1, dev->caps.reserved_srqs);
  178. if (err)
  179. return err;
  180. return 0;
  181. }
  182. void mlx4_cleanup_srq_table(struct mlx4_dev *dev)
  183. {
  184. mlx4_bitmap_cleanup(&mlx4_priv(dev)->srq_table.bitmap);
  185. }