sas_event.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163
  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 work_struct *work)
  29. {
  30. if (!test_bit(SAS_HA_REGISTERED, &ha->state))
  31. return;
  32. if (test_bit(SAS_HA_DRAINING, &ha->state))
  33. list_add(&work->entry, &ha->defer_q);
  34. else
  35. scsi_queue_work(ha->core.shost, work);
  36. }
  37. static void sas_queue_event(int event, unsigned long *pending,
  38. struct work_struct *work,
  39. struct sas_ha_struct *ha)
  40. {
  41. if (!test_and_set_bit(event, pending)) {
  42. unsigned long flags;
  43. spin_lock_irqsave(&ha->state_lock, flags);
  44. sas_queue_work(ha, work);
  45. spin_unlock_irqrestore(&ha->state_lock, flags);
  46. }
  47. }
  48. void __sas_drain_work(struct sas_ha_struct *ha)
  49. {
  50. struct workqueue_struct *wq = ha->core.shost->work_q;
  51. struct work_struct *w, *_w;
  52. set_bit(SAS_HA_DRAINING, &ha->state);
  53. /* flush submitters */
  54. spin_lock_irq(&ha->state_lock);
  55. spin_unlock_irq(&ha->state_lock);
  56. drain_workqueue(wq);
  57. spin_lock_irq(&ha->state_lock);
  58. clear_bit(SAS_HA_DRAINING, &ha->state);
  59. list_for_each_entry_safe(w, _w, &ha->defer_q, entry) {
  60. list_del_init(&w->entry);
  61. sas_queue_work(ha, w);
  62. }
  63. spin_unlock_irq(&ha->state_lock);
  64. }
  65. int sas_drain_work(struct sas_ha_struct *ha)
  66. {
  67. int err;
  68. err = mutex_lock_interruptible(&ha->drain_mutex);
  69. if (err)
  70. return err;
  71. if (test_bit(SAS_HA_REGISTERED, &ha->state))
  72. __sas_drain_work(ha);
  73. mutex_unlock(&ha->drain_mutex);
  74. return 0;
  75. }
  76. EXPORT_SYMBOL_GPL(sas_drain_work);
  77. void sas_disable_revalidation(struct sas_ha_struct *ha)
  78. {
  79. mutex_lock(&ha->disco_mutex);
  80. set_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state);
  81. mutex_unlock(&ha->disco_mutex);
  82. }
  83. void sas_enable_revalidation(struct sas_ha_struct *ha)
  84. {
  85. int i;
  86. mutex_lock(&ha->disco_mutex);
  87. clear_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state);
  88. for (i = 0; i < ha->num_phys; i++) {
  89. struct asd_sas_port *port = ha->sas_port[i];
  90. const int ev = DISCE_REVALIDATE_DOMAIN;
  91. struct sas_discovery *d = &port->disc;
  92. if (!test_and_clear_bit(ev, &d->pending))
  93. continue;
  94. sas_queue_event(ev, &d->pending, &d->disc_work[ev].work, ha);
  95. }
  96. mutex_unlock(&ha->disco_mutex);
  97. }
  98. static void notify_ha_event(struct sas_ha_struct *sas_ha, enum ha_event event)
  99. {
  100. BUG_ON(event >= HA_NUM_EVENTS);
  101. sas_queue_event(event, &sas_ha->pending,
  102. &sas_ha->ha_events[event].work, sas_ha);
  103. }
  104. static void notify_port_event(struct asd_sas_phy *phy, enum port_event event)
  105. {
  106. struct sas_ha_struct *ha = phy->ha;
  107. BUG_ON(event >= PORT_NUM_EVENTS);
  108. sas_queue_event(event, &phy->port_events_pending,
  109. &phy->port_events[event].work, ha);
  110. }
  111. static void notify_phy_event(struct asd_sas_phy *phy, enum phy_event event)
  112. {
  113. struct sas_ha_struct *ha = phy->ha;
  114. BUG_ON(event >= PHY_NUM_EVENTS);
  115. sas_queue_event(event, &phy->phy_events_pending,
  116. &phy->phy_events[event].work, ha);
  117. }
  118. int sas_init_events(struct sas_ha_struct *sas_ha)
  119. {
  120. static const work_func_t sas_ha_event_fns[HA_NUM_EVENTS] = {
  121. [HAE_RESET] = sas_hae_reset,
  122. };
  123. int i;
  124. for (i = 0; i < HA_NUM_EVENTS; i++) {
  125. INIT_WORK(&sas_ha->ha_events[i].work, sas_ha_event_fns[i]);
  126. sas_ha->ha_events[i].ha = sas_ha;
  127. }
  128. sas_ha->notify_ha_event = notify_ha_event;
  129. sas_ha->notify_port_event = notify_port_event;
  130. sas_ha->notify_phy_event = notify_phy_event;
  131. return 0;
  132. }