iwl-notif-wait.c 5.9 KB

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