sas_event.c 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165
  1. /*
  2. * Serial Attached SCSI (SAS) Event processing
  3. *
  4. * Copyright (C) 2005 Adaptec, Inc. All rights reserved.
  5. * Copyright (C) 2005 Luben Tuikov <luben_tuikov@adaptec.com>
  6. *
  7. * This file is licensed under GPLv2.
  8. *
  9. * This program is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU General Public License as
  11. * published by the Free Software Foundation; either version 2 of the
  12. * License, or (at your option) any later version.
  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 St, Fifth Floor, Boston, MA 02110-1301 USA
  22. *
  23. */
  24. #include <linux/export.h>
  25. #include <scsi/scsi_host.h>
  26. #include "sas_internal.h"
  27. #include "sas_dump.h"
  28. void sas_queue_work(struct sas_ha_struct *ha, struct sas_work *sw)
  29. {
  30. if (!test_bit(SAS_HA_REGISTERED, &ha->state))
  31. return;
  32. if (test_bit(SAS_HA_DRAINING, &ha->state)) {
  33. /* add it to the defer list, if not already pending */
  34. if (list_empty(&sw->drain_node))
  35. list_add(&sw->drain_node, &ha->defer_q);
  36. } else
  37. scsi_queue_work(ha->core.shost, &sw->work);
  38. }
  39. static void sas_queue_event(int event, unsigned long *pending,
  40. struct sas_work *work,
  41. struct sas_ha_struct *ha)
  42. {
  43. if (!test_and_set_bit(event, pending)) {
  44. unsigned long flags;
  45. spin_lock_irqsave(&ha->lock, flags);
  46. sas_queue_work(ha, work);
  47. spin_unlock_irqrestore(&ha->lock, flags);
  48. }
  49. }
  50. void __sas_drain_work(struct sas_ha_struct *ha)
  51. {
  52. struct workqueue_struct *wq = ha->core.shost->work_q;
  53. struct sas_work *sw, *_sw;
  54. set_bit(SAS_HA_DRAINING, &ha->state);
  55. /* flush submitters */
  56. spin_lock_irq(&ha->lock);
  57. spin_unlock_irq(&ha->lock);
  58. drain_workqueue(wq);
  59. spin_lock_irq(&ha->lock);
  60. clear_bit(SAS_HA_DRAINING, &ha->state);
  61. list_for_each_entry_safe(sw, _sw, &ha->defer_q, drain_node) {
  62. list_del_init(&sw->drain_node);
  63. sas_queue_work(ha, sw);
  64. }
  65. spin_unlock_irq(&ha->lock);
  66. }
  67. int sas_drain_work(struct sas_ha_struct *ha)
  68. {
  69. int err;
  70. err = mutex_lock_interruptible(&ha->drain_mutex);
  71. if (err)
  72. return err;
  73. if (test_bit(SAS_HA_REGISTERED, &ha->state))
  74. __sas_drain_work(ha);
  75. mutex_unlock(&ha->drain_mutex);
  76. return 0;
  77. }
  78. EXPORT_SYMBOL_GPL(sas_drain_work);
  79. void sas_disable_revalidation(struct sas_ha_struct *ha)
  80. {
  81. mutex_lock(&ha->disco_mutex);
  82. set_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state);
  83. mutex_unlock(&ha->disco_mutex);
  84. }
  85. void sas_enable_revalidation(struct sas_ha_struct *ha)
  86. {
  87. int i;
  88. mutex_lock(&ha->disco_mutex);
  89. clear_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state);
  90. for (i = 0; i < ha->num_phys; i++) {
  91. struct asd_sas_port *port = ha->sas_port[i];
  92. const int ev = DISCE_REVALIDATE_DOMAIN;
  93. struct sas_discovery *d = &port->disc;
  94. if (!test_and_clear_bit(ev, &d->pending))
  95. continue;
  96. sas_queue_event(ev, &d->pending, &d->disc_work[ev].work, ha);
  97. }
  98. mutex_unlock(&ha->disco_mutex);
  99. }
  100. static void notify_ha_event(struct sas_ha_struct *sas_ha, enum ha_event event)
  101. {
  102. BUG_ON(event >= HA_NUM_EVENTS);
  103. sas_queue_event(event, &sas_ha->pending,
  104. &sas_ha->ha_events[event].work, sas_ha);
  105. }
  106. static void notify_port_event(struct asd_sas_phy *phy, enum port_event event)
  107. {
  108. struct sas_ha_struct *ha = phy->ha;
  109. BUG_ON(event >= PORT_NUM_EVENTS);
  110. sas_queue_event(event, &phy->port_events_pending,
  111. &phy->port_events[event].work, ha);
  112. }
  113. void sas_notify_phy_event(struct asd_sas_phy *phy, enum phy_event event)
  114. {
  115. struct sas_ha_struct *ha = phy->ha;
  116. BUG_ON(event >= PHY_NUM_EVENTS);
  117. sas_queue_event(event, &phy->phy_events_pending,
  118. &phy->phy_events[event].work, ha);
  119. }
  120. int sas_init_events(struct sas_ha_struct *sas_ha)
  121. {
  122. static const work_func_t sas_ha_event_fns[HA_NUM_EVENTS] = {
  123. [HAE_RESET] = sas_hae_reset,
  124. };
  125. int i;
  126. for (i = 0; i < HA_NUM_EVENTS; i++) {
  127. INIT_SAS_WORK(&sas_ha->ha_events[i].work, sas_ha_event_fns[i]);
  128. sas_ha->ha_events[i].ha = sas_ha;
  129. }
  130. sas_ha->notify_ha_event = notify_ha_event;
  131. sas_ha->notify_port_event = notify_port_event;
  132. sas_ha->notify_phy_event = sas_notify_phy_event;
  133. return 0;
  134. }