iwl-notif-wait.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  1. /******************************************************************************
  2. *
  3. * This file is provided under a dual BSD/GPLv2 license. When using or
  4. * redistributing this file, you may do so under either license.
  5. *
  6. * GPL LICENSE SUMMARY
  7. *
  8. * Copyright(c) 2007 - 2014 Intel Corporation. All rights reserved.
  9. * Copyright(c) 2015 Intel Deutschland GmbH
  10. *
  11. * This program is free software; you can redistribute it and/or modify
  12. * it under the terms of version 2 of the GNU General Public License as
  13. * published by the Free Software Foundation.
  14. *
  15. * This program is distributed in the hope that it will be useful, but
  16. * WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to the Free Software
  22. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110,
  23. * USA
  24. *
  25. * The full GNU General Public License is included in this distribution
  26. * in the file called COPYING.
  27. *
  28. * Contact Information:
  29. * Intel Linux Wireless <ilw@linux.intel.com>
  30. * Intel Corporation, 5200 N.E. Elam Young Parkway, Hillsboro, OR 97124-6497
  31. *
  32. * BSD LICENSE
  33. *
  34. * Copyright(c) 2005 - 2014 Intel Corporation. All rights reserved.
  35. * All rights reserved.
  36. *
  37. * Redistribution and use in source and binary forms, with or without
  38. * modification, are permitted provided that the following conditions
  39. * are met:
  40. *
  41. * * Redistributions of source code must retain the above copyright
  42. * notice, this list of conditions and the following disclaimer.
  43. * * Redistributions in binary form must reproduce the above copyright
  44. * notice, this list of conditions and the following disclaimer in
  45. * the documentation and/or other materials provided with the
  46. * distribution.
  47. * * Neither the name Intel Corporation nor the names of its
  48. * contributors may be used to endorse or promote products derived
  49. * from this software without specific prior written permission.
  50. *
  51. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  52. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  53. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  54. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  55. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  56. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  57. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  58. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  59. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  60. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  61. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  62. *
  63. *****************************************************************************/
  64. #include <linux/sched.h>
  65. #include <linux/export.h>
  66. #include "iwl-drv.h"
  67. #include "iwl-notif-wait.h"
  68. void iwl_notification_wait_init(struct iwl_notif_wait_data *notif_wait)
  69. {
  70. spin_lock_init(&notif_wait->notif_wait_lock);
  71. INIT_LIST_HEAD(&notif_wait->notif_waits);
  72. init_waitqueue_head(&notif_wait->notif_waitq);
  73. }
  74. IWL_EXPORT_SYMBOL(iwl_notification_wait_init);
  75. void iwl_notification_wait_notify(struct iwl_notif_wait_data *notif_wait,
  76. struct iwl_rx_packet *pkt)
  77. {
  78. bool triggered = false;
  79. if (!list_empty(&notif_wait->notif_waits)) {
  80. struct iwl_notification_wait *w;
  81. spin_lock(&notif_wait->notif_wait_lock);
  82. list_for_each_entry(w, &notif_wait->notif_waits, list) {
  83. int i;
  84. bool found = false;
  85. /*
  86. * If it already finished (triggered) or has been
  87. * aborted then don't evaluate it again to avoid races,
  88. * Otherwise the function could be called again even
  89. * though it returned true before
  90. */
  91. if (w->triggered || w->aborted)
  92. continue;
  93. for (i = 0; i < w->n_cmds; i++) {
  94. if (w->cmds[i] ==
  95. WIDE_ID(pkt->hdr.group_id, pkt->hdr.cmd)) {
  96. found = true;
  97. break;
  98. }
  99. }
  100. if (!found)
  101. continue;
  102. if (!w->fn || w->fn(notif_wait, pkt, w->fn_data)) {
  103. w->triggered = true;
  104. triggered = true;
  105. }
  106. }
  107. spin_unlock(&notif_wait->notif_wait_lock);
  108. }
  109. if (triggered)
  110. wake_up_all(&notif_wait->notif_waitq);
  111. }
  112. IWL_EXPORT_SYMBOL(iwl_notification_wait_notify);
  113. void iwl_abort_notification_waits(struct iwl_notif_wait_data *notif_wait)
  114. {
  115. struct iwl_notification_wait *wait_entry;
  116. spin_lock(&notif_wait->notif_wait_lock);
  117. list_for_each_entry(wait_entry, &notif_wait->notif_waits, list)
  118. wait_entry->aborted = true;
  119. spin_unlock(&notif_wait->notif_wait_lock);
  120. wake_up_all(&notif_wait->notif_waitq);
  121. }
  122. IWL_EXPORT_SYMBOL(iwl_abort_notification_waits);
  123. void
  124. iwl_init_notification_wait(struct iwl_notif_wait_data *notif_wait,
  125. struct iwl_notification_wait *wait_entry,
  126. const u16 *cmds, int n_cmds,
  127. bool (*fn)(struct iwl_notif_wait_data *notif_wait,
  128. struct iwl_rx_packet *pkt, void *data),
  129. void *fn_data)
  130. {
  131. if (WARN_ON(n_cmds > MAX_NOTIF_CMDS))
  132. n_cmds = MAX_NOTIF_CMDS;
  133. wait_entry->fn = fn;
  134. wait_entry->fn_data = fn_data;
  135. wait_entry->n_cmds = n_cmds;
  136. memcpy(wait_entry->cmds, cmds, n_cmds * sizeof(u16));
  137. wait_entry->triggered = false;
  138. wait_entry->aborted = false;
  139. spin_lock_bh(&notif_wait->notif_wait_lock);
  140. list_add(&wait_entry->list, &notif_wait->notif_waits);
  141. spin_unlock_bh(&notif_wait->notif_wait_lock);
  142. }
  143. IWL_EXPORT_SYMBOL(iwl_init_notification_wait);
  144. int iwl_wait_notification(struct iwl_notif_wait_data *notif_wait,
  145. struct iwl_notification_wait *wait_entry,
  146. unsigned long timeout)
  147. {
  148. int ret;
  149. ret = wait_event_timeout(notif_wait->notif_waitq,
  150. wait_entry->triggered || wait_entry->aborted,
  151. timeout);
  152. spin_lock_bh(&notif_wait->notif_wait_lock);
  153. list_del(&wait_entry->list);
  154. spin_unlock_bh(&notif_wait->notif_wait_lock);
  155. if (wait_entry->aborted)
  156. return -EIO;
  157. /* return value is always >= 0 */
  158. if (ret <= 0)
  159. return -ETIMEDOUT;
  160. return 0;
  161. }
  162. IWL_EXPORT_SYMBOL(iwl_wait_notification);
  163. void iwl_remove_notification(struct iwl_notif_wait_data *notif_wait,
  164. struct iwl_notification_wait *wait_entry)
  165. {
  166. spin_lock_bh(&notif_wait->notif_wait_lock);
  167. list_del(&wait_entry->list);
  168. spin_unlock_bh(&notif_wait->notif_wait_lock);
  169. }
  170. IWL_EXPORT_SYMBOL(iwl_remove_notification);