en_cq.c 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232
  1. /*
  2. * Copyright (c) 2007 Mellanox Technologies. 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. */
  33. #include <linux/mlx4/cq.h>
  34. #include <linux/mlx4/qp.h>
  35. #include <linux/mlx4/cmd.h>
  36. #include "mlx4_en.h"
  37. static void mlx4_en_cq_event(struct mlx4_cq *cq, enum mlx4_event event)
  38. {
  39. return;
  40. }
  41. int mlx4_en_create_cq(struct mlx4_en_priv *priv,
  42. struct mlx4_en_cq **pcq,
  43. int entries, int ring, enum cq_type mode,
  44. int node)
  45. {
  46. struct mlx4_en_dev *mdev = priv->mdev;
  47. struct mlx4_en_cq *cq;
  48. int err;
  49. cq = kzalloc_node(sizeof(*cq), GFP_KERNEL, node);
  50. if (!cq) {
  51. cq = kzalloc(sizeof(*cq), GFP_KERNEL);
  52. if (!cq) {
  53. en_err(priv, "Failed to allocate CQ structure\n");
  54. return -ENOMEM;
  55. }
  56. }
  57. cq->size = entries;
  58. cq->buf_size = cq->size * mdev->dev->caps.cqe_size;
  59. cq->ring = ring;
  60. cq->is_tx = mode;
  61. /* Allocate HW buffers on provided NUMA node.
  62. * dev->numa_node is used in mtt range allocation flow.
  63. */
  64. set_dev_node(&mdev->dev->persist->pdev->dev, node);
  65. err = mlx4_alloc_hwq_res(mdev->dev, &cq->wqres,
  66. cq->buf_size, 2 * PAGE_SIZE);
  67. set_dev_node(&mdev->dev->persist->pdev->dev, mdev->dev->numa_node);
  68. if (err)
  69. goto err_cq;
  70. err = mlx4_en_map_buffer(&cq->wqres.buf);
  71. if (err)
  72. goto err_res;
  73. cq->buf = (struct mlx4_cqe *)cq->wqres.buf.direct.buf;
  74. *pcq = cq;
  75. return 0;
  76. err_res:
  77. mlx4_free_hwq_res(mdev->dev, &cq->wqres, cq->buf_size);
  78. err_cq:
  79. kfree(cq);
  80. *pcq = NULL;
  81. return err;
  82. }
  83. int mlx4_en_activate_cq(struct mlx4_en_priv *priv, struct mlx4_en_cq *cq,
  84. int cq_idx)
  85. {
  86. struct mlx4_en_dev *mdev = priv->mdev;
  87. int err = 0;
  88. char name[25];
  89. int timestamp_en = 0;
  90. struct cpu_rmap *rmap =
  91. #ifdef CONFIG_RFS_ACCEL
  92. priv->dev->rx_cpu_rmap;
  93. #else
  94. NULL;
  95. #endif
  96. cq->dev = mdev->pndev[priv->port];
  97. cq->mcq.set_ci_db = cq->wqres.db.db;
  98. cq->mcq.arm_db = cq->wqres.db.db + 1;
  99. *cq->mcq.set_ci_db = 0;
  100. *cq->mcq.arm_db = 0;
  101. memset(cq->buf, 0, cq->buf_size);
  102. if (cq->is_tx == RX) {
  103. if (mdev->dev->caps.comp_pool) {
  104. if (!cq->vector) {
  105. sprintf(name, "%s-%d", priv->dev->name,
  106. cq->ring);
  107. /* Set IRQ for specific name (per ring) */
  108. if (mlx4_assign_eq(mdev->dev, name, rmap,
  109. &cq->vector)) {
  110. cq->vector = (cq->ring + 1 + priv->port)
  111. % mdev->dev->caps.num_comp_vectors;
  112. mlx4_warn(mdev, "Failed assigning an EQ to %s, falling back to legacy EQ's\n",
  113. name);
  114. }
  115. }
  116. } else {
  117. cq->vector = (cq->ring + 1 + priv->port) %
  118. mdev->dev->caps.num_comp_vectors;
  119. }
  120. cq->irq_desc =
  121. irq_to_desc(mlx4_eq_get_irq(mdev->dev,
  122. cq->vector));
  123. } else {
  124. /* For TX we use the same irq per
  125. ring we assigned for the RX */
  126. struct mlx4_en_cq *rx_cq;
  127. cq_idx = cq_idx % priv->rx_ring_num;
  128. rx_cq = priv->rx_cq[cq_idx];
  129. cq->vector = rx_cq->vector;
  130. }
  131. if (!cq->is_tx)
  132. cq->size = priv->rx_ring[cq->ring]->actual_size;
  133. if ((cq->is_tx && priv->hwtstamp_config.tx_type) ||
  134. (!cq->is_tx && priv->hwtstamp_config.rx_filter))
  135. timestamp_en = 1;
  136. err = mlx4_cq_alloc(mdev->dev, cq->size, &cq->wqres.mtt,
  137. &mdev->priv_uar, cq->wqres.db.dma, &cq->mcq,
  138. cq->vector, 0, timestamp_en);
  139. if (err)
  140. return err;
  141. cq->mcq.comp = cq->is_tx ? mlx4_en_tx_irq : mlx4_en_rx_irq;
  142. cq->mcq.event = mlx4_en_cq_event;
  143. if (cq->is_tx) {
  144. netif_napi_add(cq->dev, &cq->napi, mlx4_en_poll_tx_cq,
  145. NAPI_POLL_WEIGHT);
  146. } else {
  147. struct mlx4_en_rx_ring *ring = priv->rx_ring[cq->ring];
  148. err = irq_set_affinity_hint(cq->mcq.irq,
  149. ring->affinity_mask);
  150. if (err)
  151. mlx4_warn(mdev, "Failed setting affinity hint\n");
  152. netif_napi_add(cq->dev, &cq->napi, mlx4_en_poll_rx_cq, 64);
  153. napi_hash_add(&cq->napi);
  154. }
  155. napi_enable(&cq->napi);
  156. return 0;
  157. }
  158. void mlx4_en_destroy_cq(struct mlx4_en_priv *priv, struct mlx4_en_cq **pcq)
  159. {
  160. struct mlx4_en_dev *mdev = priv->mdev;
  161. struct mlx4_en_cq *cq = *pcq;
  162. mlx4_en_unmap_buffer(&cq->wqres.buf);
  163. mlx4_free_hwq_res(mdev->dev, &cq->wqres, cq->buf_size);
  164. if (priv->mdev->dev->caps.comp_pool && cq->vector) {
  165. mlx4_release_eq(priv->mdev->dev, cq->vector);
  166. }
  167. cq->vector = 0;
  168. cq->buf_size = 0;
  169. cq->buf = NULL;
  170. kfree(cq);
  171. *pcq = NULL;
  172. }
  173. void mlx4_en_deactivate_cq(struct mlx4_en_priv *priv, struct mlx4_en_cq *cq)
  174. {
  175. napi_disable(&cq->napi);
  176. if (!cq->is_tx) {
  177. napi_hash_del(&cq->napi);
  178. synchronize_rcu();
  179. irq_set_affinity_hint(cq->mcq.irq, NULL);
  180. }
  181. netif_napi_del(&cq->napi);
  182. mlx4_cq_free(priv->mdev->dev, &cq->mcq);
  183. }
  184. /* Set rx cq moderation parameters */
  185. int mlx4_en_set_cq_moder(struct mlx4_en_priv *priv, struct mlx4_en_cq *cq)
  186. {
  187. return mlx4_cq_modify(priv->mdev->dev, &cq->mcq,
  188. cq->moder_cnt, cq->moder_time);
  189. }
  190. int mlx4_en_arm_cq(struct mlx4_en_priv *priv, struct mlx4_en_cq *cq)
  191. {
  192. mlx4_cq_arm(&cq->mcq, MLX4_CQ_DB_REQ_NOT, priv->mdev->uar_map,
  193. &priv->mdev->uar_lock);
  194. return 0;
  195. }