dpcsup.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331
  1. /*
  2. * Adaptec AAC series RAID controller driver
  3. * (c) Copyright 2001 Red Hat Inc. <alan@redhat.com>
  4. *
  5. * based on the old aacraid driver that is..
  6. * Adaptec aacraid device driver for Linux.
  7. *
  8. * Copyright (c) 2000-2007 Adaptec, Inc. (aacraid@adaptec.com)
  9. *
  10. * This program is free software; you can redistribute it and/or modify
  11. * it under the terms of the GNU General Public License as published by
  12. * the Free Software Foundation; either version 2, or (at your option)
  13. * any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  18. * GNU General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; see the file COPYING. If not, write to
  22. * the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
  23. *
  24. * Module Name:
  25. * dpcsup.c
  26. *
  27. * Abstract: All DPC processing routines for the cyclone board occur here.
  28. *
  29. *
  30. */
  31. #include <linux/kernel.h>
  32. #include <linux/init.h>
  33. #include <linux/types.h>
  34. #include <linux/spinlock.h>
  35. #include <linux/slab.h>
  36. #include <linux/completion.h>
  37. #include <linux/blkdev.h>
  38. #include <linux/semaphore.h>
  39. #include "aacraid.h"
  40. /**
  41. * aac_response_normal - Handle command replies
  42. * @q: Queue to read from
  43. *
  44. * This DPC routine will be run when the adapter interrupts us to let us
  45. * know there is a response on our normal priority queue. We will pull off
  46. * all QE there are and wake up all the waiters before exiting. We will
  47. * take a spinlock out on the queue before operating on it.
  48. */
  49. unsigned int aac_response_normal(struct aac_queue * q)
  50. {
  51. struct aac_dev * dev = q->dev;
  52. struct aac_entry *entry;
  53. struct hw_fib * hwfib;
  54. struct fib * fib;
  55. int consumed = 0;
  56. unsigned long flags;
  57. spin_lock_irqsave(q->lock, flags);
  58. /*
  59. * Keep pulling response QEs off the response queue and waking
  60. * up the waiters until there are no more QEs. We then return
  61. * back to the system. If no response was requesed we just
  62. * deallocate the Fib here and continue.
  63. */
  64. while(aac_consumer_get(dev, q, &entry))
  65. {
  66. int fast;
  67. u32 index = le32_to_cpu(entry->addr);
  68. fast = index & 0x01;
  69. fib = &dev->fibs[index >> 2];
  70. hwfib = fib->hw_fib_va;
  71. aac_consumer_free(dev, q, HostNormRespQueue);
  72. /*
  73. * Remove this fib from the Outstanding I/O queue.
  74. * But only if it has not already been timed out.
  75. *
  76. * If the fib has been timed out already, then just
  77. * continue. The caller has already been notified that
  78. * the fib timed out.
  79. */
  80. dev->queues->queue[AdapNormCmdQueue].numpending--;
  81. if (unlikely(fib->flags & FIB_CONTEXT_FLAG_TIMED_OUT)) {
  82. spin_unlock_irqrestore(q->lock, flags);
  83. aac_fib_complete(fib);
  84. aac_fib_free(fib);
  85. spin_lock_irqsave(q->lock, flags);
  86. continue;
  87. }
  88. spin_unlock_irqrestore(q->lock, flags);
  89. if (fast) {
  90. /*
  91. * Doctor the fib
  92. */
  93. *(__le32 *)hwfib->data = cpu_to_le32(ST_OK);
  94. hwfib->header.XferState |= cpu_to_le32(AdapterProcessed);
  95. }
  96. FIB_COUNTER_INCREMENT(aac_config.FibRecved);
  97. if (hwfib->header.Command == cpu_to_le16(NuFileSystem))
  98. {
  99. __le32 *pstatus = (__le32 *)hwfib->data;
  100. if (*pstatus & cpu_to_le32(0xffff0000))
  101. *pstatus = cpu_to_le32(ST_OK);
  102. }
  103. if (hwfib->header.XferState & cpu_to_le32(NoResponseExpected | Async))
  104. {
  105. if (hwfib->header.XferState & cpu_to_le32(NoResponseExpected))
  106. FIB_COUNTER_INCREMENT(aac_config.NoResponseRecved);
  107. else
  108. FIB_COUNTER_INCREMENT(aac_config.AsyncRecved);
  109. /*
  110. * NOTE: we cannot touch the fib after this
  111. * call, because it may have been deallocated.
  112. */
  113. fib->flags = 0;
  114. fib->callback(fib->callback_data, fib);
  115. } else {
  116. unsigned long flagv;
  117. spin_lock_irqsave(&fib->event_lock, flagv);
  118. if (!fib->done)
  119. fib->done = 1;
  120. up(&fib->event_wait);
  121. spin_unlock_irqrestore(&fib->event_lock, flagv);
  122. FIB_COUNTER_INCREMENT(aac_config.NormalRecved);
  123. if (fib->done == 2) {
  124. aac_fib_complete(fib);
  125. aac_fib_free(fib);
  126. }
  127. }
  128. consumed++;
  129. spin_lock_irqsave(q->lock, flags);
  130. }
  131. if (consumed > aac_config.peak_fibs)
  132. aac_config.peak_fibs = consumed;
  133. if (consumed == 0)
  134. aac_config.zero_fibs++;
  135. spin_unlock_irqrestore(q->lock, flags);
  136. return 0;
  137. }
  138. /**
  139. * aac_command_normal - handle commands
  140. * @q: queue to process
  141. *
  142. * This DPC routine will be queued when the adapter interrupts us to
  143. * let us know there is a command on our normal priority queue. We will
  144. * pull off all QE there are and wake up all the waiters before exiting.
  145. * We will take a spinlock out on the queue before operating on it.
  146. */
  147. unsigned int aac_command_normal(struct aac_queue *q)
  148. {
  149. struct aac_dev * dev = q->dev;
  150. struct aac_entry *entry;
  151. unsigned long flags;
  152. spin_lock_irqsave(q->lock, flags);
  153. /*
  154. * Keep pulling response QEs off the response queue and waking
  155. * up the waiters until there are no more QEs. We then return
  156. * back to the system.
  157. */
  158. while(aac_consumer_get(dev, q, &entry))
  159. {
  160. struct fib fibctx;
  161. struct hw_fib * hw_fib;
  162. u32 index;
  163. struct fib *fib = &fibctx;
  164. index = le32_to_cpu(entry->addr) / sizeof(struct hw_fib);
  165. hw_fib = &dev->aif_base_va[index];
  166. /*
  167. * Allocate a FIB at all costs. For non queued stuff
  168. * we can just use the stack so we are happy. We need
  169. * a fib object in order to manage the linked lists
  170. */
  171. if (dev->aif_thread)
  172. if((fib = kmalloc(sizeof(struct fib), GFP_ATOMIC)) == NULL)
  173. fib = &fibctx;
  174. memset(fib, 0, sizeof(struct fib));
  175. INIT_LIST_HEAD(&fib->fiblink);
  176. fib->type = FSAFS_NTC_FIB_CONTEXT;
  177. fib->size = sizeof(struct fib);
  178. fib->hw_fib_va = hw_fib;
  179. fib->data = hw_fib->data;
  180. fib->dev = dev;
  181. if (dev->aif_thread && fib != &fibctx) {
  182. list_add_tail(&fib->fiblink, &q->cmdq);
  183. aac_consumer_free(dev, q, HostNormCmdQueue);
  184. wake_up_interruptible(&q->cmdready);
  185. } else {
  186. aac_consumer_free(dev, q, HostNormCmdQueue);
  187. spin_unlock_irqrestore(q->lock, flags);
  188. /*
  189. * Set the status of this FIB
  190. */
  191. *(__le32 *)hw_fib->data = cpu_to_le32(ST_OK);
  192. aac_fib_adapter_complete(fib, sizeof(u32));
  193. spin_lock_irqsave(q->lock, flags);
  194. }
  195. }
  196. spin_unlock_irqrestore(q->lock, flags);
  197. return 0;
  198. }
  199. /**
  200. * aac_intr_normal - Handle command replies
  201. * @dev: Device
  202. * @index: completion reference
  203. *
  204. * This DPC routine will be run when the adapter interrupts us to let us
  205. * know there is a response on our normal priority queue. We will pull off
  206. * all QE there are and wake up all the waiters before exiting.
  207. */
  208. unsigned int aac_intr_normal(struct aac_dev * dev, u32 index)
  209. {
  210. dprintk((KERN_INFO "aac_intr_normal(%p,%x)\n", dev, index));
  211. if ((index & 0x00000002L)) {
  212. struct hw_fib * hw_fib;
  213. struct fib * fib;
  214. struct aac_queue *q = &dev->queues->queue[HostNormCmdQueue];
  215. unsigned long flags;
  216. if (index == 0xFFFFFFFEL) /* Special Case */
  217. return 0; /* Do nothing */
  218. /*
  219. * Allocate a FIB. For non queued stuff we can just use
  220. * the stack so we are happy. We need a fib object in order to
  221. * manage the linked lists.
  222. */
  223. if ((!dev->aif_thread)
  224. || (!(fib = kzalloc(sizeof(struct fib),GFP_ATOMIC))))
  225. return 1;
  226. if (!(hw_fib = kzalloc(sizeof(struct hw_fib),GFP_ATOMIC))) {
  227. kfree (fib);
  228. return 1;
  229. }
  230. memcpy(hw_fib, (struct hw_fib *)(((uintptr_t)(dev->regs.sa)) +
  231. (index & ~0x00000002L)), sizeof(struct hw_fib));
  232. INIT_LIST_HEAD(&fib->fiblink);
  233. fib->type = FSAFS_NTC_FIB_CONTEXT;
  234. fib->size = sizeof(struct fib);
  235. fib->hw_fib_va = hw_fib;
  236. fib->data = hw_fib->data;
  237. fib->dev = dev;
  238. spin_lock_irqsave(q->lock, flags);
  239. list_add_tail(&fib->fiblink, &q->cmdq);
  240. wake_up_interruptible(&q->cmdready);
  241. spin_unlock_irqrestore(q->lock, flags);
  242. return 1;
  243. } else {
  244. int fast = index & 0x01;
  245. struct fib * fib = &dev->fibs[index >> 2];
  246. struct hw_fib * hwfib = fib->hw_fib_va;
  247. /*
  248. * Remove this fib from the Outstanding I/O queue.
  249. * But only if it has not already been timed out.
  250. *
  251. * If the fib has been timed out already, then just
  252. * continue. The caller has already been notified that
  253. * the fib timed out.
  254. */
  255. dev->queues->queue[AdapNormCmdQueue].numpending--;
  256. if (unlikely(fib->flags & FIB_CONTEXT_FLAG_TIMED_OUT)) {
  257. aac_fib_complete(fib);
  258. aac_fib_free(fib);
  259. return 0;
  260. }
  261. if (fast) {
  262. /*
  263. * Doctor the fib
  264. */
  265. *(__le32 *)hwfib->data = cpu_to_le32(ST_OK);
  266. hwfib->header.XferState |= cpu_to_le32(AdapterProcessed);
  267. }
  268. FIB_COUNTER_INCREMENT(aac_config.FibRecved);
  269. if (hwfib->header.Command == cpu_to_le16(NuFileSystem))
  270. {
  271. __le32 *pstatus = (__le32 *)hwfib->data;
  272. if (*pstatus & cpu_to_le32(0xffff0000))
  273. *pstatus = cpu_to_le32(ST_OK);
  274. }
  275. if (hwfib->header.XferState & cpu_to_le32(NoResponseExpected | Async))
  276. {
  277. if (hwfib->header.XferState & cpu_to_le32(NoResponseExpected))
  278. FIB_COUNTER_INCREMENT(aac_config.NoResponseRecved);
  279. else
  280. FIB_COUNTER_INCREMENT(aac_config.AsyncRecved);
  281. /*
  282. * NOTE: we cannot touch the fib after this
  283. * call, because it may have been deallocated.
  284. */
  285. fib->flags = 0;
  286. fib->callback(fib->callback_data, fib);
  287. } else {
  288. unsigned long flagv;
  289. dprintk((KERN_INFO "event_wait up\n"));
  290. spin_lock_irqsave(&fib->event_lock, flagv);
  291. if (!fib->done)
  292. fib->done = 1;
  293. up(&fib->event_wait);
  294. spin_unlock_irqrestore(&fib->event_lock, flagv);
  295. FIB_COUNTER_INCREMENT(aac_config.NormalRecved);
  296. }
  297. return 0;
  298. }
  299. }