asl.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367
  1. /*
  2. * Wireless Host Controller (WHC) asynchronous schedule management.
  3. *
  4. * Copyright (C) 2007 Cambridge Silicon Radio Ltd.
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License version
  8. * 2 as published by the Free Software Foundation.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. #include <linux/kernel.h>
  19. #include <linux/dma-mapping.h>
  20. #include <linux/uwb/umc.h>
  21. #include <linux/usb.h>
  22. #define D_LOCAL 0
  23. #include <linux/uwb/debug.h>
  24. #include "../../wusbcore/wusbhc.h"
  25. #include "whcd.h"
  26. #if D_LOCAL >= 4
  27. static void dump_asl(struct whc *whc, const char *tag)
  28. {
  29. struct device *dev = &whc->umc->dev;
  30. struct whc_qset *qset;
  31. d_printf(4, dev, "ASL %s\n", tag);
  32. list_for_each_entry(qset, &whc->async_list, list_node) {
  33. dump_qset(qset, dev);
  34. }
  35. }
  36. #else
  37. static inline void dump_asl(struct whc *whc, const char *tag)
  38. {
  39. }
  40. #endif
  41. static void qset_get_next_prev(struct whc *whc, struct whc_qset *qset,
  42. struct whc_qset **next, struct whc_qset **prev)
  43. {
  44. struct list_head *n, *p;
  45. BUG_ON(list_empty(&whc->async_list));
  46. n = qset->list_node.next;
  47. if (n == &whc->async_list)
  48. n = n->next;
  49. p = qset->list_node.prev;
  50. if (p == &whc->async_list)
  51. p = p->prev;
  52. *next = container_of(n, struct whc_qset, list_node);
  53. *prev = container_of(p, struct whc_qset, list_node);
  54. }
  55. static void asl_qset_insert_begin(struct whc *whc, struct whc_qset *qset)
  56. {
  57. list_move(&qset->list_node, &whc->async_list);
  58. qset->in_sw_list = true;
  59. }
  60. static void asl_qset_insert(struct whc *whc, struct whc_qset *qset)
  61. {
  62. struct whc_qset *next, *prev;
  63. qset_clear(whc, qset);
  64. /* Link into ASL. */
  65. qset_get_next_prev(whc, qset, &next, &prev);
  66. whc_qset_set_link_ptr(&qset->qh.link, next->qset_dma);
  67. whc_qset_set_link_ptr(&prev->qh.link, qset->qset_dma);
  68. qset->in_hw_list = true;
  69. }
  70. static void asl_qset_remove(struct whc *whc, struct whc_qset *qset)
  71. {
  72. struct whc_qset *prev, *next;
  73. qset_get_next_prev(whc, qset, &next, &prev);
  74. list_move(&qset->list_node, &whc->async_removed_list);
  75. qset->in_sw_list = false;
  76. /*
  77. * No more qsets in the ASL? The caller must stop the ASL as
  78. * it's no longer valid.
  79. */
  80. if (list_empty(&whc->async_list))
  81. return;
  82. /* Remove from ASL. */
  83. whc_qset_set_link_ptr(&prev->qh.link, next->qset_dma);
  84. qset->in_hw_list = false;
  85. }
  86. /**
  87. * process_qset - process any recently inactivated or halted qTDs in a
  88. * qset.
  89. *
  90. * After inactive qTDs are removed, new qTDs can be added if the
  91. * urb queue still contains URBs.
  92. *
  93. * Returns any additional WUSBCMD bits for the ASL sync command (i.e.,
  94. * WUSBCMD_ASYNC_QSET_RM if a halted qset was removed).
  95. */
  96. static uint32_t process_qset(struct whc *whc, struct whc_qset *qset)
  97. {
  98. enum whc_update update = 0;
  99. uint32_t status = 0;
  100. while (qset->ntds) {
  101. struct whc_qtd *td;
  102. int t;
  103. t = qset->td_start;
  104. td = &qset->qtd[qset->td_start];
  105. status = le32_to_cpu(td->status);
  106. /*
  107. * Nothing to do with a still active qTD.
  108. */
  109. if (status & QTD_STS_ACTIVE)
  110. break;
  111. if (status & QTD_STS_HALTED) {
  112. /* Ug, an error. */
  113. process_halted_qtd(whc, qset, td);
  114. goto done;
  115. }
  116. /* Mmm, a completed qTD. */
  117. process_inactive_qtd(whc, qset, td);
  118. }
  119. update |= qset_add_qtds(whc, qset);
  120. done:
  121. /*
  122. * Remove this qset from the ASL if requested, but only if has
  123. * no qTDs.
  124. */
  125. if (qset->remove && qset->ntds == 0) {
  126. asl_qset_remove(whc, qset);
  127. update |= WHC_UPDATE_REMOVED;
  128. }
  129. return update;
  130. }
  131. void asl_start(struct whc *whc)
  132. {
  133. struct whc_qset *qset;
  134. qset = list_first_entry(&whc->async_list, struct whc_qset, list_node);
  135. le_writeq(qset->qset_dma | QH_LINK_NTDS(8), whc->base + WUSBASYNCLISTADDR);
  136. whc_write_wusbcmd(whc, WUSBCMD_ASYNC_EN, WUSBCMD_ASYNC_EN);
  137. whci_wait_for(&whc->umc->dev, whc->base + WUSBSTS,
  138. WUSBSTS_ASYNC_SCHED, WUSBSTS_ASYNC_SCHED,
  139. 1000, "start ASL");
  140. }
  141. void asl_stop(struct whc *whc)
  142. {
  143. whc_write_wusbcmd(whc, WUSBCMD_ASYNC_EN, 0);
  144. whci_wait_for(&whc->umc->dev, whc->base + WUSBSTS,
  145. WUSBSTS_ASYNC_SCHED, 0,
  146. 1000, "stop ASL");
  147. }
  148. void asl_update(struct whc *whc, uint32_t wusbcmd)
  149. {
  150. whc_write_wusbcmd(whc, wusbcmd, wusbcmd);
  151. wait_event(whc->async_list_wq,
  152. (le_readl(whc->base + WUSBCMD) & WUSBCMD_ASYNC_UPDATED) == 0);
  153. }
  154. /**
  155. * scan_async_work - scan the ASL for qsets to process.
  156. *
  157. * Process each qset in the ASL in turn and then signal the WHC that
  158. * the ASL has been updated.
  159. *
  160. * Then start, stop or update the asynchronous schedule as required.
  161. */
  162. void scan_async_work(struct work_struct *work)
  163. {
  164. struct whc *whc = container_of(work, struct whc, async_work);
  165. struct whc_qset *qset, *t;
  166. enum whc_update update = 0;
  167. spin_lock_irq(&whc->lock);
  168. dump_asl(whc, "before processing");
  169. /*
  170. * Transerve the software list backwards so new qsets can be
  171. * safely inserted into the ASL without making it non-circular.
  172. */
  173. list_for_each_entry_safe_reverse(qset, t, &whc->async_list, list_node) {
  174. if (!qset->in_hw_list) {
  175. asl_qset_insert(whc, qset);
  176. update |= WHC_UPDATE_ADDED;
  177. }
  178. update |= process_qset(whc, qset);
  179. }
  180. dump_asl(whc, "after processing");
  181. spin_unlock_irq(&whc->lock);
  182. if (update) {
  183. uint32_t wusbcmd = WUSBCMD_ASYNC_UPDATED | WUSBCMD_ASYNC_SYNCED_DB;
  184. if (update & WHC_UPDATE_REMOVED)
  185. wusbcmd |= WUSBCMD_ASYNC_QSET_RM;
  186. asl_update(whc, wusbcmd);
  187. }
  188. /*
  189. * Now that the ASL is updated, complete the removal of any
  190. * removed qsets.
  191. */
  192. spin_lock(&whc->lock);
  193. list_for_each_entry_safe(qset, t, &whc->async_removed_list, list_node) {
  194. qset_remove_complete(whc, qset);
  195. }
  196. spin_unlock(&whc->lock);
  197. }
  198. /**
  199. * asl_urb_enqueue - queue an URB onto the asynchronous list (ASL).
  200. * @whc: the WHCI host controller
  201. * @urb: the URB to enqueue
  202. * @mem_flags: flags for any memory allocations
  203. *
  204. * The qset for the endpoint is obtained and the urb queued on to it.
  205. *
  206. * Work is scheduled to update the hardware's view of the ASL.
  207. */
  208. int asl_urb_enqueue(struct whc *whc, struct urb *urb, gfp_t mem_flags)
  209. {
  210. struct whc_qset *qset;
  211. int err;
  212. unsigned long flags;
  213. spin_lock_irqsave(&whc->lock, flags);
  214. qset = get_qset(whc, urb, GFP_ATOMIC);
  215. if (qset == NULL)
  216. err = -ENOMEM;
  217. else
  218. err = qset_add_urb(whc, qset, urb, GFP_ATOMIC);
  219. if (!err) {
  220. usb_hcd_link_urb_to_ep(&whc->wusbhc.usb_hcd, urb);
  221. if (!qset->in_sw_list)
  222. asl_qset_insert_begin(whc, qset);
  223. }
  224. spin_unlock_irqrestore(&whc->lock, flags);
  225. if (!err)
  226. queue_work(whc->workqueue, &whc->async_work);
  227. return 0;
  228. }
  229. /**
  230. * asl_urb_dequeue - remove an URB (qset) from the async list.
  231. * @whc: the WHCI host controller
  232. * @urb: the URB to dequeue
  233. * @status: the current status of the URB
  234. *
  235. * URBs that do yet have qTDs can simply be removed from the software
  236. * queue, otherwise the qset must be removed from the ASL so the qTDs
  237. * can be removed.
  238. */
  239. int asl_urb_dequeue(struct whc *whc, struct urb *urb, int status)
  240. {
  241. struct whc_urb *wurb = urb->hcpriv;
  242. struct whc_qset *qset = wurb->qset;
  243. struct whc_std *std, *t;
  244. int ret;
  245. unsigned long flags;
  246. spin_lock_irqsave(&whc->lock, flags);
  247. ret = usb_hcd_check_unlink_urb(&whc->wusbhc.usb_hcd, urb, status);
  248. if (ret < 0)
  249. goto out;
  250. list_for_each_entry_safe(std, t, &qset->stds, list_node) {
  251. if (std->urb == urb)
  252. qset_free_std(whc, std);
  253. else
  254. std->qtd = NULL; /* so this std is re-added when the qset is */
  255. }
  256. asl_qset_remove(whc, qset);
  257. wurb->status = status;
  258. wurb->is_async = true;
  259. queue_work(whc->workqueue, &wurb->dequeue_work);
  260. out:
  261. spin_unlock_irqrestore(&whc->lock, flags);
  262. return ret;
  263. }
  264. /**
  265. * asl_qset_delete - delete a qset from the ASL
  266. */
  267. void asl_qset_delete(struct whc *whc, struct whc_qset *qset)
  268. {
  269. qset->remove = 1;
  270. queue_work(whc->workqueue, &whc->async_work);
  271. qset_delete(whc, qset);
  272. }
  273. /**
  274. * asl_init - initialize the asynchronous schedule list
  275. *
  276. * A dummy qset with no qTDs is added to the ASL to simplify removing
  277. * qsets (no need to stop the ASL when the last qset is removed).
  278. */
  279. int asl_init(struct whc *whc)
  280. {
  281. struct whc_qset *qset;
  282. qset = qset_alloc(whc, GFP_KERNEL);
  283. if (qset == NULL)
  284. return -ENOMEM;
  285. asl_qset_insert_begin(whc, qset);
  286. asl_qset_insert(whc, qset);
  287. return 0;
  288. }
  289. /**
  290. * asl_clean_up - free ASL resources
  291. *
  292. * The ASL is stopped and empty except for the dummy qset.
  293. */
  294. void asl_clean_up(struct whc *whc)
  295. {
  296. struct whc_qset *qset;
  297. if (!list_empty(&whc->async_list)) {
  298. qset = list_first_entry(&whc->async_list, struct whc_qset, list_node);
  299. list_del(&qset->list_node);
  300. qset_free(whc, qset);
  301. }
  302. }