ehca_eq.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187
  1. /*
  2. * IBM eServer eHCA Infiniband device driver for Linux on POWER
  3. *
  4. * Event queue handling
  5. *
  6. * Authors: Waleri Fomin <fomin@de.ibm.com>
  7. * Khadija Souissi <souissi@de.ibm.com>
  8. * Reinhard Ernst <rernst@de.ibm.com>
  9. * Heiko J Schick <schickhj@de.ibm.com>
  10. * Hoang-Nam Nguyen <hnguyen@de.ibm.com>
  11. *
  12. *
  13. * Copyright (c) 2005 IBM Corporation
  14. *
  15. * All rights reserved.
  16. *
  17. * This source code is distributed under a dual license of GPL v2.0 and OpenIB
  18. * BSD.
  19. *
  20. * OpenIB BSD License
  21. *
  22. * Redistribution and use in source and binary forms, with or without
  23. * modification, are permitted provided that the following conditions are met:
  24. *
  25. * Redistributions of source code must retain the above copyright notice, this
  26. * list of conditions and the following disclaimer.
  27. *
  28. * Redistributions in binary form must reproduce the above copyright notice,
  29. * this list of conditions and the following disclaimer in the documentation
  30. * and/or other materials
  31. * provided with the distribution.
  32. *
  33. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  34. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  35. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  36. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  37. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  38. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  39. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
  40. * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
  41. * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  42. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  43. * POSSIBILITY OF SUCH DAMAGE.
  44. */
  45. #include "ehca_classes.h"
  46. #include "ehca_irq.h"
  47. #include "ehca_iverbs.h"
  48. #include "ehca_qes.h"
  49. #include "hcp_if.h"
  50. #include "ipz_pt_fn.h"
  51. int ehca_create_eq(struct ehca_shca *shca,
  52. struct ehca_eq *eq,
  53. const enum ehca_eq_type type, const u32 length)
  54. {
  55. u64 ret;
  56. u32 nr_pages;
  57. u32 i;
  58. void *vpage;
  59. struct ib_device *ib_dev = &shca->ib_device;
  60. spin_lock_init(&eq->spinlock);
  61. spin_lock_init(&eq->irq_spinlock);
  62. eq->is_initialized = 0;
  63. if (type != EHCA_EQ && type != EHCA_NEQ) {
  64. ehca_err(ib_dev, "Invalid EQ type %x. eq=%p", type, eq);
  65. return -EINVAL;
  66. }
  67. if (!length) {
  68. ehca_err(ib_dev, "EQ length must not be zero. eq=%p", eq);
  69. return -EINVAL;
  70. }
  71. ret = hipz_h_alloc_resource_eq(shca->ipz_hca_handle,
  72. &eq->pf,
  73. type,
  74. length,
  75. &eq->ipz_eq_handle,
  76. &eq->length,
  77. &nr_pages, &eq->ist);
  78. if (ret != H_SUCCESS) {
  79. ehca_err(ib_dev, "Can't allocate EQ/NEQ. eq=%p", eq);
  80. return -EINVAL;
  81. }
  82. ret = ipz_queue_ctor(NULL, &eq->ipz_queue, nr_pages,
  83. EHCA_PAGESIZE, sizeof(struct ehca_eqe), 0, 0);
  84. if (!ret) {
  85. ehca_err(ib_dev, "Can't allocate EQ pages eq=%p", eq);
  86. goto create_eq_exit1;
  87. }
  88. for (i = 0; i < nr_pages; i++) {
  89. u64 rpage;
  90. vpage = ipz_qpageit_get_inc(&eq->ipz_queue);
  91. if (!vpage) {
  92. ret = H_RESOURCE;
  93. goto create_eq_exit2;
  94. }
  95. rpage = virt_to_abs(vpage);
  96. ret = hipz_h_register_rpage_eq(shca->ipz_hca_handle,
  97. eq->ipz_eq_handle,
  98. &eq->pf,
  99. 0, 0, rpage, 1);
  100. if (i == (nr_pages - 1)) {
  101. /* last page */
  102. vpage = ipz_qpageit_get_inc(&eq->ipz_queue);
  103. if (ret != H_SUCCESS || vpage)
  104. goto create_eq_exit2;
  105. } else {
  106. if (ret != H_PAGE_REGISTERED || !vpage)
  107. goto create_eq_exit2;
  108. }
  109. }
  110. ipz_qeit_reset(&eq->ipz_queue);
  111. /* register interrupt handlers and initialize work queues */
  112. if (type == EHCA_EQ) {
  113. ret = ibmebus_request_irq(eq->ist, ehca_interrupt_eq,
  114. IRQF_DISABLED, "ehca_eq",
  115. (void *)shca);
  116. if (ret < 0)
  117. ehca_err(ib_dev, "Can't map interrupt handler.");
  118. tasklet_init(&eq->interrupt_task, ehca_tasklet_eq, (long)shca);
  119. } else if (type == EHCA_NEQ) {
  120. ret = ibmebus_request_irq(eq->ist, ehca_interrupt_neq,
  121. IRQF_DISABLED, "ehca_neq",
  122. (void *)shca);
  123. if (ret < 0)
  124. ehca_err(ib_dev, "Can't map interrupt handler.");
  125. tasklet_init(&eq->interrupt_task, ehca_tasklet_neq, (long)shca);
  126. }
  127. eq->is_initialized = 1;
  128. return 0;
  129. create_eq_exit2:
  130. ipz_queue_dtor(NULL, &eq->ipz_queue);
  131. create_eq_exit1:
  132. hipz_h_destroy_eq(shca->ipz_hca_handle, eq);
  133. return -EINVAL;
  134. }
  135. void *ehca_poll_eq(struct ehca_shca *shca, struct ehca_eq *eq)
  136. {
  137. unsigned long flags;
  138. void *eqe;
  139. spin_lock_irqsave(&eq->spinlock, flags);
  140. eqe = ipz_eqit_eq_get_inc_valid(&eq->ipz_queue);
  141. spin_unlock_irqrestore(&eq->spinlock, flags);
  142. return eqe;
  143. }
  144. int ehca_destroy_eq(struct ehca_shca *shca, struct ehca_eq *eq)
  145. {
  146. unsigned long flags;
  147. u64 h_ret;
  148. spin_lock_irqsave(&eq->spinlock, flags);
  149. ibmebus_free_irq(eq->ist, (void *)shca);
  150. h_ret = hipz_h_destroy_eq(shca->ipz_hca_handle, eq);
  151. spin_unlock_irqrestore(&eq->spinlock, flags);
  152. if (h_ret != H_SUCCESS) {
  153. ehca_err(&shca->ib_device, "Can't free EQ resources.");
  154. return -EINVAL;
  155. }
  156. ipz_queue_dtor(NULL, &eq->ipz_queue);
  157. return 0;
  158. }