sas_event.c 4.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156
  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. static 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. int 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. int err;
  53. err = mutex_lock_interruptible(&ha->drain_mutex);
  54. if (err)
  55. return err;
  56. set_bit(SAS_HA_DRAINING, &ha->state);
  57. /* flush submitters */
  58. spin_lock_irq(&ha->state_lock);
  59. spin_unlock_irq(&ha->state_lock);
  60. drain_workqueue(wq);
  61. spin_lock_irq(&ha->state_lock);
  62. clear_bit(SAS_HA_DRAINING, &ha->state);
  63. list_for_each_entry_safe(w, _w, &ha->defer_q, entry) {
  64. list_del_init(&w->entry);
  65. sas_queue_work(ha, w);
  66. }
  67. spin_unlock_irq(&ha->state_lock);
  68. mutex_unlock(&ha->drain_mutex);
  69. return 0;
  70. }
  71. EXPORT_SYMBOL_GPL(sas_drain_work);
  72. void sas_disable_revalidation(struct sas_ha_struct *ha)
  73. {
  74. mutex_lock(&ha->disco_mutex);
  75. set_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state);
  76. mutex_unlock(&ha->disco_mutex);
  77. }
  78. void sas_enable_revalidation(struct sas_ha_struct *ha)
  79. {
  80. int i;
  81. mutex_lock(&ha->disco_mutex);
  82. clear_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state);
  83. for (i = 0; i < ha->num_phys; i++) {
  84. struct asd_sas_port *port = ha->sas_port[i];
  85. const int ev = DISCE_REVALIDATE_DOMAIN;
  86. struct sas_discovery *d = &port->disc;
  87. if (!test_and_clear_bit(ev, &d->pending))
  88. continue;
  89. sas_queue_event(ev, &d->pending, &d->disc_work[ev].work, ha);
  90. }
  91. mutex_unlock(&ha->disco_mutex);
  92. }
  93. static void notify_ha_event(struct sas_ha_struct *sas_ha, enum ha_event event)
  94. {
  95. BUG_ON(event >= HA_NUM_EVENTS);
  96. sas_queue_event(event, &sas_ha->pending,
  97. &sas_ha->ha_events[event].work, sas_ha);
  98. }
  99. static void notify_port_event(struct asd_sas_phy *phy, enum port_event event)
  100. {
  101. struct sas_ha_struct *ha = phy->ha;
  102. BUG_ON(event >= PORT_NUM_EVENTS);
  103. sas_queue_event(event, &phy->port_events_pending,
  104. &phy->port_events[event].work, ha);
  105. }
  106. static void notify_phy_event(struct asd_sas_phy *phy, enum phy_event event)
  107. {
  108. struct sas_ha_struct *ha = phy->ha;
  109. BUG_ON(event >= PHY_NUM_EVENTS);
  110. sas_queue_event(event, &phy->phy_events_pending,
  111. &phy->phy_events[event].work, ha);
  112. }
  113. int sas_init_events(struct sas_ha_struct *sas_ha)
  114. {
  115. static const work_func_t sas_ha_event_fns[HA_NUM_EVENTS] = {
  116. [HAE_RESET] = sas_hae_reset,
  117. };
  118. int i;
  119. for (i = 0; i < HA_NUM_EVENTS; i++) {
  120. INIT_WORK(&sas_ha->ha_events[i].work, sas_ha_event_fns[i]);
  121. sas_ha->ha_events[i].ha = sas_ha;
  122. }
  123. sas_ha->notify_ha_event = notify_ha_event;
  124. sas_ha->notify_port_event = notify_port_event;
  125. sas_ha->notify_phy_event = notify_phy_event;
  126. return 0;
  127. }