rxe_cq.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186
  1. /*
  2. * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
  3. * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/vmalloc.h>
  34. #include "rxe.h"
  35. #include "rxe_loc.h"
  36. #include "rxe_queue.h"
  37. int rxe_cq_chk_attr(struct rxe_dev *rxe, struct rxe_cq *cq,
  38. int cqe, int comp_vector)
  39. {
  40. int count;
  41. if (cqe <= 0) {
  42. pr_warn("cqe(%d) <= 0\n", cqe);
  43. goto err1;
  44. }
  45. if (cqe > rxe->attr.max_cqe) {
  46. pr_warn("cqe(%d) > max_cqe(%d)\n",
  47. cqe, rxe->attr.max_cqe);
  48. goto err1;
  49. }
  50. if (cq) {
  51. count = queue_count(cq->queue);
  52. if (cqe < count) {
  53. pr_warn("cqe(%d) < current # elements in queue (%d)",
  54. cqe, count);
  55. goto err1;
  56. }
  57. }
  58. return 0;
  59. err1:
  60. return -EINVAL;
  61. }
  62. static void rxe_send_complete(unsigned long data)
  63. {
  64. struct rxe_cq *cq = (struct rxe_cq *)data;
  65. unsigned long flags;
  66. spin_lock_irqsave(&cq->cq_lock, flags);
  67. if (cq->is_dying) {
  68. spin_unlock_irqrestore(&cq->cq_lock, flags);
  69. return;
  70. }
  71. spin_unlock_irqrestore(&cq->cq_lock, flags);
  72. cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context);
  73. }
  74. int rxe_cq_from_init(struct rxe_dev *rxe, struct rxe_cq *cq, int cqe,
  75. int comp_vector, struct ib_ucontext *context,
  76. struct rxe_create_cq_resp __user *uresp)
  77. {
  78. int err;
  79. cq->queue = rxe_queue_init(rxe, &cqe,
  80. sizeof(struct rxe_cqe));
  81. if (!cq->queue) {
  82. pr_warn("unable to create cq\n");
  83. return -ENOMEM;
  84. }
  85. err = do_mmap_info(rxe, uresp ? &uresp->mi : NULL, context,
  86. cq->queue->buf, cq->queue->buf_size, &cq->queue->ip);
  87. if (err) {
  88. vfree(cq->queue->buf);
  89. kfree(cq->queue);
  90. return err;
  91. }
  92. if (uresp)
  93. cq->is_user = 1;
  94. cq->is_dying = false;
  95. tasklet_init(&cq->comp_task, rxe_send_complete, (unsigned long)cq);
  96. spin_lock_init(&cq->cq_lock);
  97. cq->ibcq.cqe = cqe;
  98. return 0;
  99. }
  100. int rxe_cq_resize_queue(struct rxe_cq *cq, int cqe,
  101. struct rxe_resize_cq_resp __user *uresp)
  102. {
  103. int err;
  104. err = rxe_queue_resize(cq->queue, (unsigned int *)&cqe,
  105. sizeof(struct rxe_cqe),
  106. cq->queue->ip ? cq->queue->ip->context : NULL,
  107. uresp ? &uresp->mi : NULL, NULL, &cq->cq_lock);
  108. if (!err)
  109. cq->ibcq.cqe = cqe;
  110. return err;
  111. }
  112. int rxe_cq_post(struct rxe_cq *cq, struct rxe_cqe *cqe, int solicited)
  113. {
  114. struct ib_event ev;
  115. unsigned long flags;
  116. spin_lock_irqsave(&cq->cq_lock, flags);
  117. if (unlikely(queue_full(cq->queue))) {
  118. spin_unlock_irqrestore(&cq->cq_lock, flags);
  119. if (cq->ibcq.event_handler) {
  120. ev.device = cq->ibcq.device;
  121. ev.element.cq = &cq->ibcq;
  122. ev.event = IB_EVENT_CQ_ERR;
  123. cq->ibcq.event_handler(&ev, cq->ibcq.cq_context);
  124. }
  125. return -EBUSY;
  126. }
  127. memcpy(producer_addr(cq->queue), cqe, sizeof(*cqe));
  128. /* make sure all changes to the CQ are written before we update the
  129. * producer pointer
  130. */
  131. smp_wmb();
  132. advance_producer(cq->queue);
  133. spin_unlock_irqrestore(&cq->cq_lock, flags);
  134. if ((cq->notify == IB_CQ_NEXT_COMP) ||
  135. (cq->notify == IB_CQ_SOLICITED && solicited)) {
  136. cq->notify = 0;
  137. tasklet_schedule(&cq->comp_task);
  138. }
  139. return 0;
  140. }
  141. void rxe_cq_disable(struct rxe_cq *cq)
  142. {
  143. unsigned long flags;
  144. spin_lock_irqsave(&cq->cq_lock, flags);
  145. cq->is_dying = true;
  146. spin_unlock_irqrestore(&cq->cq_lock, flags);
  147. }
  148. void rxe_cq_cleanup(struct rxe_pool_entry *arg)
  149. {
  150. struct rxe_cq *cq = container_of(arg, typeof(*cq), pelem);
  151. if (cq->queue)
  152. rxe_queue_cleanup(cq->queue);
  153. }