Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 | /* * Serial Attached SCSI (SAS) Event processing * * Copyright (C) 2005 Adaptec, Inc. All rights reserved. * Copyright (C) 2005 Luben Tuikov <luben_tuikov@adaptec.com> * * This file is licensed under GPLv2. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License as * published by the Free Software Foundation; either version 2 of the * License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA * */ #include <linux/export.h> #include <scsi/scsi_host.h> #include "sas_internal.h" int sas_queue_work(struct sas_ha_struct *ha, struct sas_work *sw) { /* it's added to the defer_q when draining so return succeed */ int rc = 1; if (!test_bit(SAS_HA_REGISTERED, &ha->state)) return 0; if (test_bit(SAS_HA_DRAINING, &ha->state)) { /* add it to the defer list, if not already pending */ if (list_empty(&sw->drain_node)) list_add_tail(&sw->drain_node, &ha->defer_q); } else rc = queue_work(ha->event_q, &sw->work); return rc; } static int sas_queue_event(int event, struct sas_work *work, struct sas_ha_struct *ha) { unsigned long flags; int rc; spin_lock_irqsave(&ha->lock, flags); rc = sas_queue_work(ha, work); spin_unlock_irqrestore(&ha->lock, flags); return rc; } void __sas_drain_work(struct sas_ha_struct *ha) { struct sas_work *sw, *_sw; int ret; set_bit(SAS_HA_DRAINING, &ha->state); /* flush submitters */ spin_lock_irq(&ha->lock); spin_unlock_irq(&ha->lock); drain_workqueue(ha->event_q); drain_workqueue(ha->disco_q); spin_lock_irq(&ha->lock); clear_bit(SAS_HA_DRAINING, &ha->state); list_for_each_entry_safe(sw, _sw, &ha->defer_q, drain_node) { list_del_init(&sw->drain_node); ret = sas_queue_work(ha, sw); if (ret != 1) sas_free_event(to_asd_sas_event(&sw->work)); } spin_unlock_irq(&ha->lock); } int sas_drain_work(struct sas_ha_struct *ha) { int err; err = mutex_lock_interruptible(&ha->drain_mutex); if (err) return err; if (test_bit(SAS_HA_REGISTERED, &ha->state)) __sas_drain_work(ha); mutex_unlock(&ha->drain_mutex); return 0; } EXPORT_SYMBOL_GPL(sas_drain_work); void sas_disable_revalidation(struct sas_ha_struct *ha) { mutex_lock(&ha->disco_mutex); set_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state); mutex_unlock(&ha->disco_mutex); } void sas_enable_revalidation(struct sas_ha_struct *ha) { int i; mutex_lock(&ha->disco_mutex); clear_bit(SAS_HA_ATA_EH_ACTIVE, &ha->state); for (i = 0; i < ha->num_phys; i++) { struct asd_sas_port *port = ha->sas_port[i]; const int ev = DISCE_REVALIDATE_DOMAIN; struct sas_discovery *d = &port->disc; struct asd_sas_phy *sas_phy; if (!test_and_clear_bit(ev, &d->pending)) continue; if (list_empty(&port->phy_list)) continue; sas_phy = container_of(port->phy_list.next, struct asd_sas_phy, port_phy_el); ha->notify_port_event(sas_phy, PORTE_BROADCAST_RCVD); } mutex_unlock(&ha->disco_mutex); } static void sas_port_event_worker(struct work_struct *work) { struct asd_sas_event *ev = to_asd_sas_event(work); sas_port_event_fns[ev->event](work); sas_free_event(ev); } static void sas_phy_event_worker(struct work_struct *work) { struct asd_sas_event *ev = to_asd_sas_event(work); sas_phy_event_fns[ev->event](work); sas_free_event(ev); } static int sas_notify_port_event(struct asd_sas_phy *phy, enum port_event event) { struct asd_sas_event *ev; struct sas_ha_struct *ha = phy->ha; int ret; BUG_ON(event >= PORT_NUM_EVENTS); ev = sas_alloc_event(phy); if (!ev) return -ENOMEM; INIT_SAS_EVENT(ev, sas_port_event_worker, phy, event); ret = sas_queue_event(event, &ev->work, ha); if (ret != 1) sas_free_event(ev); return ret; } int sas_notify_phy_event(struct asd_sas_phy *phy, enum phy_event event) { struct asd_sas_event *ev; struct sas_ha_struct *ha = phy->ha; int ret; BUG_ON(event >= PHY_NUM_EVENTS); ev = sas_alloc_event(phy); if (!ev) return -ENOMEM; INIT_SAS_EVENT(ev, sas_phy_event_worker, phy, event); ret = sas_queue_event(event, &ev->work, ha); if (ret != 1) sas_free_event(ev); return ret; } int sas_init_events(struct sas_ha_struct *sas_ha) { sas_ha->notify_port_event = sas_notify_port_event; sas_ha->notify_phy_event = sas_notify_phy_event; return 0; } |