sas_init.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507
  1. /*
  2. * Serial Attached SCSI (SAS) Transport Layer initialization
  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., 59 Temple Place, Suite 330, Boston, MA 02111-1307
  22. * USA
  23. *
  24. */
  25. #include <linux/module.h>
  26. #include <linux/slab.h>
  27. #include <linux/init.h>
  28. #include <linux/device.h>
  29. #include <linux/spinlock.h>
  30. #include <scsi/sas_ata.h>
  31. #include <scsi/scsi_host.h>
  32. #include <scsi/scsi_device.h>
  33. #include <scsi/scsi_transport.h>
  34. #include <scsi/scsi_transport_sas.h>
  35. #include "sas_internal.h"
  36. #include "../scsi_sas_internal.h"
  37. static struct kmem_cache *sas_task_cache;
  38. struct sas_task *sas_alloc_task(gfp_t flags)
  39. {
  40. struct sas_task *task = kmem_cache_zalloc(sas_task_cache, flags);
  41. if (task) {
  42. INIT_LIST_HEAD(&task->list);
  43. spin_lock_init(&task->task_state_lock);
  44. task->task_state_flags = SAS_TASK_STATE_PENDING;
  45. init_timer(&task->timer);
  46. init_completion(&task->completion);
  47. }
  48. return task;
  49. }
  50. EXPORT_SYMBOL_GPL(sas_alloc_task);
  51. void sas_free_task(struct sas_task *task)
  52. {
  53. if (task) {
  54. BUG_ON(!list_empty(&task->list));
  55. kmem_cache_free(sas_task_cache, task);
  56. }
  57. }
  58. EXPORT_SYMBOL_GPL(sas_free_task);
  59. /*------------ SAS addr hash -----------*/
  60. void sas_hash_addr(u8 *hashed, const u8 *sas_addr)
  61. {
  62. const u32 poly = 0x00DB2777;
  63. u32 r = 0;
  64. int i;
  65. for (i = 0; i < 8; i++) {
  66. int b;
  67. for (b = 7; b >= 0; b--) {
  68. r <<= 1;
  69. if ((1 << b) & sas_addr[i]) {
  70. if (!(r & 0x01000000))
  71. r ^= poly;
  72. } else if (r & 0x01000000)
  73. r ^= poly;
  74. }
  75. }
  76. hashed[0] = (r >> 16) & 0xFF;
  77. hashed[1] = (r >> 8) & 0xFF ;
  78. hashed[2] = r & 0xFF;
  79. }
  80. /* ---------- HA events ---------- */
  81. void sas_hae_reset(struct work_struct *work)
  82. {
  83. struct sas_ha_event *ev =
  84. container_of(work, struct sas_ha_event, work);
  85. struct sas_ha_struct *ha = ev->ha;
  86. clear_bit(HAE_RESET, &ha->pending);
  87. }
  88. int sas_register_ha(struct sas_ha_struct *sas_ha)
  89. {
  90. int error = 0;
  91. mutex_init(&sas_ha->disco_mutex);
  92. spin_lock_init(&sas_ha->phy_port_lock);
  93. sas_hash_addr(sas_ha->hashed_sas_addr, sas_ha->sas_addr);
  94. if (sas_ha->lldd_queue_size == 0)
  95. sas_ha->lldd_queue_size = 1;
  96. else if (sas_ha->lldd_queue_size == -1)
  97. sas_ha->lldd_queue_size = 128; /* Sanity */
  98. set_bit(SAS_HA_REGISTERED, &sas_ha->state);
  99. spin_lock_init(&sas_ha->state_lock);
  100. mutex_init(&sas_ha->drain_mutex);
  101. INIT_LIST_HEAD(&sas_ha->defer_q);
  102. error = sas_register_phys(sas_ha);
  103. if (error) {
  104. printk(KERN_NOTICE "couldn't register sas phys:%d\n", error);
  105. return error;
  106. }
  107. error = sas_register_ports(sas_ha);
  108. if (error) {
  109. printk(KERN_NOTICE "couldn't register sas ports:%d\n", error);
  110. goto Undo_phys;
  111. }
  112. error = sas_init_events(sas_ha);
  113. if (error) {
  114. printk(KERN_NOTICE "couldn't start event thread:%d\n", error);
  115. goto Undo_ports;
  116. }
  117. if (sas_ha->lldd_max_execute_num > 1) {
  118. error = sas_init_queue(sas_ha);
  119. if (error) {
  120. printk(KERN_NOTICE "couldn't start queue thread:%d, "
  121. "running in direct mode\n", error);
  122. sas_ha->lldd_max_execute_num = 1;
  123. }
  124. }
  125. INIT_LIST_HEAD(&sas_ha->eh_done_q);
  126. INIT_LIST_HEAD(&sas_ha->eh_ata_q);
  127. return 0;
  128. Undo_ports:
  129. sas_unregister_ports(sas_ha);
  130. Undo_phys:
  131. return error;
  132. }
  133. int sas_unregister_ha(struct sas_ha_struct *sas_ha)
  134. {
  135. unsigned long flags;
  136. /* Set the state to unregistered to avoid further unchained
  137. * events to be queued
  138. */
  139. spin_lock_irqsave(&sas_ha->state_lock, flags);
  140. clear_bit(SAS_HA_REGISTERED, &sas_ha->state);
  141. spin_unlock_irqrestore(&sas_ha->state_lock, flags);
  142. sas_drain_work(sas_ha);
  143. sas_unregister_ports(sas_ha);
  144. sas_drain_work(sas_ha);
  145. if (sas_ha->lldd_max_execute_num > 1) {
  146. sas_shutdown_queue(sas_ha);
  147. sas_ha->lldd_max_execute_num = 1;
  148. }
  149. return 0;
  150. }
  151. static int sas_get_linkerrors(struct sas_phy *phy)
  152. {
  153. if (scsi_is_sas_phy_local(phy)) {
  154. struct Scsi_Host *shost = dev_to_shost(phy->dev.parent);
  155. struct sas_ha_struct *sas_ha = SHOST_TO_SAS_HA(shost);
  156. struct asd_sas_phy *asd_phy = sas_ha->sas_phy[phy->number];
  157. struct sas_internal *i =
  158. to_sas_internal(sas_ha->core.shost->transportt);
  159. return i->dft->lldd_control_phy(asd_phy, PHY_FUNC_GET_EVENTS, NULL);
  160. }
  161. return sas_smp_get_phy_events(phy);
  162. }
  163. int sas_try_ata_reset(struct asd_sas_phy *asd_phy)
  164. {
  165. struct domain_device *dev = NULL;
  166. /* try to route user requested link resets through libata */
  167. if (asd_phy->port)
  168. dev = asd_phy->port->port_dev;
  169. /* validate that dev has been probed */
  170. if (dev)
  171. dev = sas_find_dev_by_rphy(dev->rphy);
  172. if (dev && dev_is_sata(dev)) {
  173. sas_ata_schedule_reset(dev);
  174. sas_ata_wait_eh(dev);
  175. return 0;
  176. }
  177. return -ENODEV;
  178. }
  179. /**
  180. * transport_sas_phy_reset - reset a phy and permit libata to manage the link
  181. *
  182. * phy reset request via sysfs in host workqueue context so we know we
  183. * can block on eh and safely traverse the domain_device topology
  184. */
  185. static int transport_sas_phy_reset(struct sas_phy *phy, int hard_reset)
  186. {
  187. enum phy_func reset_type;
  188. if (hard_reset)
  189. reset_type = PHY_FUNC_HARD_RESET;
  190. else
  191. reset_type = PHY_FUNC_LINK_RESET;
  192. if (scsi_is_sas_phy_local(phy)) {
  193. struct Scsi_Host *shost = dev_to_shost(phy->dev.parent);
  194. struct sas_ha_struct *sas_ha = SHOST_TO_SAS_HA(shost);
  195. struct asd_sas_phy *asd_phy = sas_ha->sas_phy[phy->number];
  196. struct sas_internal *i =
  197. to_sas_internal(sas_ha->core.shost->transportt);
  198. if (!hard_reset && sas_try_ata_reset(asd_phy) == 0)
  199. return 0;
  200. return i->dft->lldd_control_phy(asd_phy, reset_type, NULL);
  201. } else {
  202. struct sas_rphy *rphy = dev_to_rphy(phy->dev.parent);
  203. struct domain_device *ddev = sas_find_dev_by_rphy(rphy);
  204. struct domain_device *ata_dev = sas_ex_to_ata(ddev, phy->number);
  205. if (ata_dev && !hard_reset) {
  206. sas_ata_schedule_reset(ata_dev);
  207. sas_ata_wait_eh(ata_dev);
  208. return 0;
  209. } else
  210. return sas_smp_phy_control(ddev, phy->number, reset_type, NULL);
  211. }
  212. }
  213. static int sas_phy_enable(struct sas_phy *phy, int enable)
  214. {
  215. int ret;
  216. enum phy_func cmd;
  217. if (enable)
  218. cmd = PHY_FUNC_LINK_RESET;
  219. else
  220. cmd = PHY_FUNC_DISABLE;
  221. if (scsi_is_sas_phy_local(phy)) {
  222. struct Scsi_Host *shost = dev_to_shost(phy->dev.parent);
  223. struct sas_ha_struct *sas_ha = SHOST_TO_SAS_HA(shost);
  224. struct asd_sas_phy *asd_phy = sas_ha->sas_phy[phy->number];
  225. struct sas_internal *i =
  226. to_sas_internal(sas_ha->core.shost->transportt);
  227. if (enable)
  228. ret = transport_sas_phy_reset(phy, 0);
  229. else
  230. ret = i->dft->lldd_control_phy(asd_phy, cmd, NULL);
  231. } else {
  232. struct sas_rphy *rphy = dev_to_rphy(phy->dev.parent);
  233. struct domain_device *ddev = sas_find_dev_by_rphy(rphy);
  234. if (enable)
  235. ret = transport_sas_phy_reset(phy, 0);
  236. else
  237. ret = sas_smp_phy_control(ddev, phy->number, cmd, NULL);
  238. }
  239. return ret;
  240. }
  241. int sas_phy_reset(struct sas_phy *phy, int hard_reset)
  242. {
  243. int ret;
  244. enum phy_func reset_type;
  245. if (hard_reset)
  246. reset_type = PHY_FUNC_HARD_RESET;
  247. else
  248. reset_type = PHY_FUNC_LINK_RESET;
  249. if (scsi_is_sas_phy_local(phy)) {
  250. struct Scsi_Host *shost = dev_to_shost(phy->dev.parent);
  251. struct sas_ha_struct *sas_ha = SHOST_TO_SAS_HA(shost);
  252. struct asd_sas_phy *asd_phy = sas_ha->sas_phy[phy->number];
  253. struct sas_internal *i =
  254. to_sas_internal(sas_ha->core.shost->transportt);
  255. ret = i->dft->lldd_control_phy(asd_phy, reset_type, NULL);
  256. } else {
  257. struct sas_rphy *rphy = dev_to_rphy(phy->dev.parent);
  258. struct domain_device *ddev = sas_find_dev_by_rphy(rphy);
  259. ret = sas_smp_phy_control(ddev, phy->number, reset_type, NULL);
  260. }
  261. return ret;
  262. }
  263. int sas_set_phy_speed(struct sas_phy *phy,
  264. struct sas_phy_linkrates *rates)
  265. {
  266. int ret;
  267. if ((rates->minimum_linkrate &&
  268. rates->minimum_linkrate > phy->maximum_linkrate) ||
  269. (rates->maximum_linkrate &&
  270. rates->maximum_linkrate < phy->minimum_linkrate))
  271. return -EINVAL;
  272. if (rates->minimum_linkrate &&
  273. rates->minimum_linkrate < phy->minimum_linkrate_hw)
  274. rates->minimum_linkrate = phy->minimum_linkrate_hw;
  275. if (rates->maximum_linkrate &&
  276. rates->maximum_linkrate > phy->maximum_linkrate_hw)
  277. rates->maximum_linkrate = phy->maximum_linkrate_hw;
  278. if (scsi_is_sas_phy_local(phy)) {
  279. struct Scsi_Host *shost = dev_to_shost(phy->dev.parent);
  280. struct sas_ha_struct *sas_ha = SHOST_TO_SAS_HA(shost);
  281. struct asd_sas_phy *asd_phy = sas_ha->sas_phy[phy->number];
  282. struct sas_internal *i =
  283. to_sas_internal(sas_ha->core.shost->transportt);
  284. ret = i->dft->lldd_control_phy(asd_phy, PHY_FUNC_SET_LINK_RATE,
  285. rates);
  286. } else {
  287. struct sas_rphy *rphy = dev_to_rphy(phy->dev.parent);
  288. struct domain_device *ddev = sas_find_dev_by_rphy(rphy);
  289. ret = sas_smp_phy_control(ddev, phy->number,
  290. PHY_FUNC_LINK_RESET, rates);
  291. }
  292. return ret;
  293. }
  294. static void sas_phy_release(struct sas_phy *phy)
  295. {
  296. kfree(phy->hostdata);
  297. phy->hostdata = NULL;
  298. }
  299. static void phy_reset_work(struct work_struct *work)
  300. {
  301. struct sas_phy_data *d = container_of(work, typeof(*d), reset_work);
  302. d->reset_result = transport_sas_phy_reset(d->phy, d->hard_reset);
  303. }
  304. static void phy_enable_work(struct work_struct *work)
  305. {
  306. struct sas_phy_data *d = container_of(work, typeof(*d), enable_work);
  307. d->enable_result = sas_phy_enable(d->phy, d->enable);
  308. }
  309. static int sas_phy_setup(struct sas_phy *phy)
  310. {
  311. struct sas_phy_data *d = kzalloc(sizeof(*d), GFP_KERNEL);
  312. if (!d)
  313. return -ENOMEM;
  314. mutex_init(&d->event_lock);
  315. INIT_WORK(&d->reset_work, phy_reset_work);
  316. INIT_WORK(&d->enable_work, phy_enable_work);
  317. d->phy = phy;
  318. phy->hostdata = d;
  319. return 0;
  320. }
  321. static int queue_phy_reset(struct sas_phy *phy, int hard_reset)
  322. {
  323. struct Scsi_Host *shost = dev_to_shost(phy->dev.parent);
  324. struct sas_ha_struct *ha = SHOST_TO_SAS_HA(shost);
  325. struct sas_phy_data *d = phy->hostdata;
  326. int rc;
  327. if (!d)
  328. return -ENOMEM;
  329. /* libsas workqueue coordinates ata-eh reset with discovery */
  330. mutex_lock(&d->event_lock);
  331. d->reset_result = 0;
  332. d->hard_reset = hard_reset;
  333. spin_lock_irq(&ha->state_lock);
  334. sas_queue_work(ha, &d->reset_work);
  335. spin_unlock_irq(&ha->state_lock);
  336. rc = sas_drain_work(ha);
  337. if (rc == 0)
  338. rc = d->reset_result;
  339. mutex_unlock(&d->event_lock);
  340. return rc;
  341. }
  342. static int queue_phy_enable(struct sas_phy *phy, int enable)
  343. {
  344. struct Scsi_Host *shost = dev_to_shost(phy->dev.parent);
  345. struct sas_ha_struct *ha = SHOST_TO_SAS_HA(shost);
  346. struct sas_phy_data *d = phy->hostdata;
  347. int rc;
  348. if (!d)
  349. return -ENOMEM;
  350. /* libsas workqueue coordinates ata-eh reset with discovery */
  351. mutex_lock(&d->event_lock);
  352. d->enable_result = 0;
  353. d->enable = enable;
  354. spin_lock_irq(&ha->state_lock);
  355. sas_queue_work(ha, &d->enable_work);
  356. spin_unlock_irq(&ha->state_lock);
  357. rc = sas_drain_work(ha);
  358. if (rc == 0)
  359. rc = d->enable_result;
  360. mutex_unlock(&d->event_lock);
  361. return rc;
  362. }
  363. static struct sas_function_template sft = {
  364. .phy_enable = queue_phy_enable,
  365. .phy_reset = queue_phy_reset,
  366. .phy_setup = sas_phy_setup,
  367. .phy_release = sas_phy_release,
  368. .set_phy_speed = sas_set_phy_speed,
  369. .get_linkerrors = sas_get_linkerrors,
  370. .smp_handler = sas_smp_handler,
  371. };
  372. struct scsi_transport_template *
  373. sas_domain_attach_transport(struct sas_domain_function_template *dft)
  374. {
  375. struct scsi_transport_template *stt = sas_attach_transport(&sft);
  376. struct sas_internal *i;
  377. if (!stt)
  378. return stt;
  379. i = to_sas_internal(stt);
  380. i->dft = dft;
  381. stt->create_work_queue = 1;
  382. stt->eh_timed_out = sas_scsi_timed_out;
  383. stt->eh_strategy_handler = sas_scsi_recover_host;
  384. return stt;
  385. }
  386. EXPORT_SYMBOL_GPL(sas_domain_attach_transport);
  387. void sas_domain_release_transport(struct scsi_transport_template *stt)
  388. {
  389. sas_release_transport(stt);
  390. }
  391. EXPORT_SYMBOL_GPL(sas_domain_release_transport);
  392. /* ---------- SAS Class register/unregister ---------- */
  393. static int __init sas_class_init(void)
  394. {
  395. sas_task_cache = KMEM_CACHE(sas_task, SLAB_HWCACHE_ALIGN);
  396. if (!sas_task_cache)
  397. return -ENOMEM;
  398. return 0;
  399. }
  400. static void __exit sas_class_exit(void)
  401. {
  402. kmem_cache_destroy(sas_task_cache);
  403. }
  404. MODULE_AUTHOR("Luben Tuikov <luben_tuikov@adaptec.com>");
  405. MODULE_DESCRIPTION("SAS Transport Layer");
  406. MODULE_LICENSE("GPL v2");
  407. module_init(sas_class_init);
  408. module_exit(sas_class_exit);
  409. EXPORT_SYMBOL_GPL(sas_register_ha);
  410. EXPORT_SYMBOL_GPL(sas_unregister_ha);