ehci-q.c 35 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273
  1. /*
  2. * Copyright (C) 2001-2004 by David Brownell
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of the GNU General Public License as published by the
  6. * Free Software Foundation; either version 2 of the License, or (at your
  7. * option) any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful, but
  10. * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
  11. * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
  12. * for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software Foundation,
  16. * Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  17. */
  18. /* this file is part of ehci-hcd.c */
  19. /*-------------------------------------------------------------------------*/
  20. /*
  21. * EHCI hardware queue manipulation ... the core. QH/QTD manipulation.
  22. *
  23. * Control, bulk, and interrupt traffic all use "qh" lists. They list "qtd"
  24. * entries describing USB transactions, max 16-20kB/entry (with 4kB-aligned
  25. * buffers needed for the larger number). We use one QH per endpoint, queue
  26. * multiple urbs (all three types) per endpoint. URBs may need several qtds.
  27. *
  28. * ISO traffic uses "ISO TD" (itd, and sitd) records, and (along with
  29. * interrupts) needs careful scheduling. Performance improvements can be
  30. * an ongoing challenge. That's in "ehci-sched.c".
  31. *
  32. * USB 1.1 devices are handled (a) by "companion" OHCI or UHCI root hubs,
  33. * or otherwise through transaction translators (TTs) in USB 2.0 hubs using
  34. * (b) special fields in qh entries or (c) split iso entries. TTs will
  35. * buffer low/full speed data so the host collects it at high speed.
  36. */
  37. /*-------------------------------------------------------------------------*/
  38. /* fill a qtd, returning how much of the buffer we were able to queue up */
  39. static int
  40. qtd_fill(struct ehci_hcd *ehci, struct ehci_qtd *qtd, dma_addr_t buf,
  41. size_t len, int token, int maxpacket)
  42. {
  43. int i, count;
  44. u64 addr = buf;
  45. /* one buffer entry per 4K ... first might be short or unaligned */
  46. qtd->hw_buf[0] = cpu_to_hc32(ehci, (u32)addr);
  47. qtd->hw_buf_hi[0] = cpu_to_hc32(ehci, (u32)(addr >> 32));
  48. count = 0x1000 - (buf & 0x0fff); /* rest of that page */
  49. if (likely (len < count)) /* ... iff needed */
  50. count = len;
  51. else {
  52. buf += 0x1000;
  53. buf &= ~0x0fff;
  54. /* per-qtd limit: from 16K to 20K (best alignment) */
  55. for (i = 1; count < len && i < 5; i++) {
  56. addr = buf;
  57. qtd->hw_buf[i] = cpu_to_hc32(ehci, (u32)addr);
  58. qtd->hw_buf_hi[i] = cpu_to_hc32(ehci,
  59. (u32)(addr >> 32));
  60. buf += 0x1000;
  61. if ((count + 0x1000) < len)
  62. count += 0x1000;
  63. else
  64. count = len;
  65. }
  66. /* short packets may only terminate transfers */
  67. if (count != len)
  68. count -= (count % maxpacket);
  69. }
  70. qtd->hw_token = cpu_to_hc32(ehci, (count << 16) | token);
  71. qtd->length = count;
  72. return count;
  73. }
  74. /*-------------------------------------------------------------------------*/
  75. static inline void
  76. qh_update (struct ehci_hcd *ehci, struct ehci_qh *qh, struct ehci_qtd *qtd)
  77. {
  78. struct ehci_qh_hw *hw = qh->hw;
  79. /* writes to an active overlay are unsafe */
  80. BUG_ON(qh->qh_state != QH_STATE_IDLE);
  81. hw->hw_qtd_next = QTD_NEXT(ehci, qtd->qtd_dma);
  82. hw->hw_alt_next = EHCI_LIST_END(ehci);
  83. /* Except for control endpoints, we make hardware maintain data
  84. * toggle (like OHCI) ... here (re)initialize the toggle in the QH,
  85. * and set the pseudo-toggle in udev. Only usb_clear_halt() will
  86. * ever clear it.
  87. */
  88. if (!(hw->hw_info1 & cpu_to_hc32(ehci, 1 << 14))) {
  89. unsigned is_out, epnum;
  90. is_out = !(qtd->hw_token & cpu_to_hc32(ehci, 1 << 8));
  91. epnum = (hc32_to_cpup(ehci, &hw->hw_info1) >> 8) & 0x0f;
  92. if (unlikely (!usb_gettoggle (qh->dev, epnum, is_out))) {
  93. hw->hw_token &= ~cpu_to_hc32(ehci, QTD_TOGGLE);
  94. usb_settoggle (qh->dev, epnum, is_out, 1);
  95. }
  96. }
  97. /* HC must see latest qtd and qh data before we clear ACTIVE+HALT */
  98. wmb ();
  99. hw->hw_token &= cpu_to_hc32(ehci, QTD_TOGGLE | QTD_STS_PING);
  100. }
  101. /* if it weren't for a common silicon quirk (writing the dummy into the qh
  102. * overlay, so qh->hw_token wrongly becomes inactive/halted), only fault
  103. * recovery (including urb dequeue) would need software changes to a QH...
  104. */
  105. static void
  106. qh_refresh (struct ehci_hcd *ehci, struct ehci_qh *qh)
  107. {
  108. struct ehci_qtd *qtd;
  109. if (list_empty (&qh->qtd_list))
  110. qtd = qh->dummy;
  111. else {
  112. qtd = list_entry (qh->qtd_list.next,
  113. struct ehci_qtd, qtd_list);
  114. /* first qtd may already be partially processed */
  115. if (cpu_to_hc32(ehci, qtd->qtd_dma) == qh->hw->hw_current)
  116. qtd = NULL;
  117. }
  118. if (qtd)
  119. qh_update (ehci, qh, qtd);
  120. }
  121. /*-------------------------------------------------------------------------*/
  122. static void qh_link_async(struct ehci_hcd *ehci, struct ehci_qh *qh);
  123. static void ehci_clear_tt_buffer_complete(struct usb_hcd *hcd,
  124. struct usb_host_endpoint *ep)
  125. {
  126. struct ehci_hcd *ehci = hcd_to_ehci(hcd);
  127. struct ehci_qh *qh = ep->hcpriv;
  128. unsigned long flags;
  129. spin_lock_irqsave(&ehci->lock, flags);
  130. qh->clearing_tt = 0;
  131. if (qh->qh_state == QH_STATE_IDLE && !list_empty(&qh->qtd_list)
  132. && HC_IS_RUNNING(hcd->state))
  133. qh_link_async(ehci, qh);
  134. spin_unlock_irqrestore(&ehci->lock, flags);
  135. }
  136. static void ehci_clear_tt_buffer(struct ehci_hcd *ehci, struct ehci_qh *qh,
  137. struct urb *urb, u32 token)
  138. {
  139. /* If an async split transaction gets an error or is unlinked,
  140. * the TT buffer may be left in an indeterminate state. We
  141. * have to clear the TT buffer.
  142. *
  143. * Note: this routine is never called for Isochronous transfers.
  144. */
  145. if (urb->dev->tt && !usb_pipeint(urb->pipe) && !qh->clearing_tt) {
  146. #ifdef DEBUG
  147. struct usb_device *tt = urb->dev->tt->hub;
  148. dev_dbg(&tt->dev,
  149. "clear tt buffer port %d, a%d ep%d t%08x\n",
  150. urb->dev->ttport, urb->dev->devnum,
  151. usb_pipeendpoint(urb->pipe), token);
  152. #endif /* DEBUG */
  153. if (!ehci_is_TDI(ehci)
  154. || urb->dev->tt->hub !=
  155. ehci_to_hcd(ehci)->self.root_hub) {
  156. if (usb_hub_clear_tt_buffer(urb) == 0)
  157. qh->clearing_tt = 1;
  158. } else {
  159. /* REVISIT ARC-derived cores don't clear the root
  160. * hub TT buffer in this way...
  161. */
  162. }
  163. }
  164. }
  165. static int qtd_copy_status (
  166. struct ehci_hcd *ehci,
  167. struct urb *urb,
  168. size_t length,
  169. u32 token
  170. )
  171. {
  172. int status = -EINPROGRESS;
  173. /* count IN/OUT bytes, not SETUP (even short packets) */
  174. if (likely (QTD_PID (token) != 2))
  175. urb->actual_length += length - QTD_LENGTH (token);
  176. /* don't modify error codes */
  177. if (unlikely(urb->unlinked))
  178. return status;
  179. /* force cleanup after short read; not always an error */
  180. if (unlikely (IS_SHORT_READ (token)))
  181. status = -EREMOTEIO;
  182. /* serious "can't proceed" faults reported by the hardware */
  183. if (token & QTD_STS_HALT) {
  184. if (token & QTD_STS_BABBLE) {
  185. /* FIXME "must" disable babbling device's port too */
  186. status = -EOVERFLOW;
  187. /* CERR nonzero + halt --> stall */
  188. } else if (QTD_CERR(token)) {
  189. status = -EPIPE;
  190. /* In theory, more than one of the following bits can be set
  191. * since they are sticky and the transaction is retried.
  192. * Which to test first is rather arbitrary.
  193. */
  194. } else if (token & QTD_STS_MMF) {
  195. /* fs/ls interrupt xfer missed the complete-split */
  196. status = -EPROTO;
  197. } else if (token & QTD_STS_DBE) {
  198. status = (QTD_PID (token) == 1) /* IN ? */
  199. ? -ENOSR /* hc couldn't read data */
  200. : -ECOMM; /* hc couldn't write data */
  201. } else if (token & QTD_STS_XACT) {
  202. /* timeout, bad CRC, wrong PID, etc */
  203. ehci_dbg(ehci, "devpath %s ep%d%s 3strikes\n",
  204. urb->dev->devpath,
  205. usb_pipeendpoint(urb->pipe),
  206. usb_pipein(urb->pipe) ? "in" : "out");
  207. status = -EPROTO;
  208. } else { /* unknown */
  209. status = -EPROTO;
  210. }
  211. ehci_vdbg (ehci,
  212. "dev%d ep%d%s qtd token %08x --> status %d\n",
  213. usb_pipedevice (urb->pipe),
  214. usb_pipeendpoint (urb->pipe),
  215. usb_pipein (urb->pipe) ? "in" : "out",
  216. token, status);
  217. }
  218. return status;
  219. }
  220. static void
  221. ehci_urb_done(struct ehci_hcd *ehci, struct urb *urb, int status)
  222. __releases(ehci->lock)
  223. __acquires(ehci->lock)
  224. {
  225. if (likely (urb->hcpriv != NULL)) {
  226. struct ehci_qh *qh = (struct ehci_qh *) urb->hcpriv;
  227. /* S-mask in a QH means it's an interrupt urb */
  228. if ((qh->hw->hw_info2 & cpu_to_hc32(ehci, QH_SMASK)) != 0) {
  229. /* ... update hc-wide periodic stats (for usbfs) */
  230. ehci_to_hcd(ehci)->self.bandwidth_int_reqs--;
  231. }
  232. qh_put (qh);
  233. }
  234. if (unlikely(urb->unlinked)) {
  235. COUNT(ehci->stats.unlink);
  236. } else {
  237. /* report non-error and short read status as zero */
  238. if (status == -EINPROGRESS || status == -EREMOTEIO)
  239. status = 0;
  240. COUNT(ehci->stats.complete);
  241. }
  242. #ifdef EHCI_URB_TRACE
  243. ehci_dbg (ehci,
  244. "%s %s urb %p ep%d%s status %d len %d/%d\n",
  245. __func__, urb->dev->devpath, urb,
  246. usb_pipeendpoint (urb->pipe),
  247. usb_pipein (urb->pipe) ? "in" : "out",
  248. status,
  249. urb->actual_length, urb->transfer_buffer_length);
  250. #endif
  251. /* complete() can reenter this HCD */
  252. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  253. spin_unlock (&ehci->lock);
  254. usb_hcd_giveback_urb(ehci_to_hcd(ehci), urb, status);
  255. spin_lock (&ehci->lock);
  256. }
  257. static void start_unlink_async (struct ehci_hcd *ehci, struct ehci_qh *qh);
  258. static void unlink_async (struct ehci_hcd *ehci, struct ehci_qh *qh);
  259. static int qh_schedule (struct ehci_hcd *ehci, struct ehci_qh *qh);
  260. /*
  261. * Process and free completed qtds for a qh, returning URBs to drivers.
  262. * Chases up to qh->hw_current. Returns number of completions called,
  263. * indicating how much "real" work we did.
  264. */
  265. static unsigned
  266. qh_completions (struct ehci_hcd *ehci, struct ehci_qh *qh)
  267. {
  268. struct ehci_qtd *last, *end = qh->dummy;
  269. struct list_head *entry, *tmp;
  270. int last_status;
  271. int stopped;
  272. unsigned count = 0;
  273. u8 state;
  274. const __le32 halt = HALT_BIT(ehci);
  275. struct ehci_qh_hw *hw = qh->hw;
  276. if (unlikely (list_empty (&qh->qtd_list)))
  277. return count;
  278. /* completions (or tasks on other cpus) must never clobber HALT
  279. * till we've gone through and cleaned everything up, even when
  280. * they add urbs to this qh's queue or mark them for unlinking.
  281. *
  282. * NOTE: unlinking expects to be done in queue order.
  283. *
  284. * It's a bug for qh->qh_state to be anything other than
  285. * QH_STATE_IDLE, unless our caller is scan_async() or
  286. * scan_periodic().
  287. */
  288. state = qh->qh_state;
  289. qh->qh_state = QH_STATE_COMPLETING;
  290. stopped = (state == QH_STATE_IDLE);
  291. rescan:
  292. last = NULL;
  293. last_status = -EINPROGRESS;
  294. qh->needs_rescan = 0;
  295. /* remove de-activated QTDs from front of queue.
  296. * after faults (including short reads), cleanup this urb
  297. * then let the queue advance.
  298. * if queue is stopped, handles unlinks.
  299. */
  300. list_for_each_safe (entry, tmp, &qh->qtd_list) {
  301. struct ehci_qtd *qtd;
  302. struct urb *urb;
  303. u32 token = 0;
  304. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  305. urb = qtd->urb;
  306. /* clean up any state from previous QTD ...*/
  307. if (last) {
  308. if (likely (last->urb != urb)) {
  309. ehci_urb_done(ehci, last->urb, last_status);
  310. count++;
  311. last_status = -EINPROGRESS;
  312. }
  313. ehci_qtd_free (ehci, last);
  314. last = NULL;
  315. }
  316. /* ignore urbs submitted during completions we reported */
  317. if (qtd == end)
  318. break;
  319. /* hardware copies qtd out of qh overlay */
  320. rmb ();
  321. token = hc32_to_cpu(ehci, qtd->hw_token);
  322. /* always clean up qtds the hc de-activated */
  323. retry_xacterr:
  324. if ((token & QTD_STS_ACTIVE) == 0) {
  325. /* on STALL, error, and short reads this urb must
  326. * complete and all its qtds must be recycled.
  327. */
  328. if ((token & QTD_STS_HALT) != 0) {
  329. /* retry transaction errors until we
  330. * reach the software xacterr limit
  331. */
  332. if ((token & QTD_STS_XACT) &&
  333. QTD_CERR(token) == 0 &&
  334. ++qh->xacterrs < QH_XACTERR_MAX &&
  335. !urb->unlinked) {
  336. ehci_dbg(ehci,
  337. "detected XactErr len %zu/%zu retry %d\n",
  338. qtd->length - QTD_LENGTH(token), qtd->length, qh->xacterrs);
  339. /* reset the token in the qtd and the
  340. * qh overlay (which still contains
  341. * the qtd) so that we pick up from
  342. * where we left off
  343. */
  344. token &= ~QTD_STS_HALT;
  345. token |= QTD_STS_ACTIVE |
  346. (EHCI_TUNE_CERR << 10);
  347. qtd->hw_token = cpu_to_hc32(ehci,
  348. token);
  349. wmb();
  350. hw->hw_token = cpu_to_hc32(ehci,
  351. token);
  352. goto retry_xacterr;
  353. }
  354. stopped = 1;
  355. /* magic dummy for some short reads; qh won't advance.
  356. * that silicon quirk can kick in with this dummy too.
  357. *
  358. * other short reads won't stop the queue, including
  359. * control transfers (status stage handles that) or
  360. * most other single-qtd reads ... the queue stops if
  361. * URB_SHORT_NOT_OK was set so the driver submitting
  362. * the urbs could clean it up.
  363. */
  364. } else if (IS_SHORT_READ (token)
  365. && !(qtd->hw_alt_next
  366. & EHCI_LIST_END(ehci))) {
  367. stopped = 1;
  368. goto halt;
  369. }
  370. /* stop scanning when we reach qtds the hc is using */
  371. } else if (likely (!stopped
  372. && HC_IS_RUNNING (ehci_to_hcd(ehci)->state))) {
  373. break;
  374. /* scan the whole queue for unlinks whenever it stops */
  375. } else {
  376. stopped = 1;
  377. /* cancel everything if we halt, suspend, etc */
  378. if (!HC_IS_RUNNING(ehci_to_hcd(ehci)->state))
  379. last_status = -ESHUTDOWN;
  380. /* this qtd is active; skip it unless a previous qtd
  381. * for its urb faulted, or its urb was canceled.
  382. */
  383. else if (last_status == -EINPROGRESS && !urb->unlinked)
  384. continue;
  385. /* qh unlinked; token in overlay may be most current */
  386. if (state == QH_STATE_IDLE
  387. && cpu_to_hc32(ehci, qtd->qtd_dma)
  388. == hw->hw_current) {
  389. token = hc32_to_cpu(ehci, hw->hw_token);
  390. /* An unlink may leave an incomplete
  391. * async transaction in the TT buffer.
  392. * We have to clear it.
  393. */
  394. ehci_clear_tt_buffer(ehci, qh, urb, token);
  395. }
  396. /* force halt for unlinked or blocked qh, so we'll
  397. * patch the qh later and so that completions can't
  398. * activate it while we "know" it's stopped.
  399. */
  400. if ((halt & hw->hw_token) == 0) {
  401. halt:
  402. hw->hw_token |= halt;
  403. wmb ();
  404. }
  405. }
  406. /* unless we already know the urb's status, collect qtd status
  407. * and update count of bytes transferred. in common short read
  408. * cases with only one data qtd (including control transfers),
  409. * queue processing won't halt. but with two or more qtds (for
  410. * example, with a 32 KB transfer), when the first qtd gets a
  411. * short read the second must be removed by hand.
  412. */
  413. if (last_status == -EINPROGRESS) {
  414. last_status = qtd_copy_status(ehci, urb,
  415. qtd->length, token);
  416. if (last_status == -EREMOTEIO
  417. && (qtd->hw_alt_next
  418. & EHCI_LIST_END(ehci)))
  419. last_status = -EINPROGRESS;
  420. /* As part of low/full-speed endpoint-halt processing
  421. * we must clear the TT buffer (11.17.5).
  422. */
  423. if (unlikely(last_status != -EINPROGRESS &&
  424. last_status != -EREMOTEIO))
  425. ehci_clear_tt_buffer(ehci, qh, urb, token);
  426. }
  427. /* if we're removing something not at the queue head,
  428. * patch the hardware queue pointer.
  429. */
  430. if (stopped && qtd->qtd_list.prev != &qh->qtd_list) {
  431. last = list_entry (qtd->qtd_list.prev,
  432. struct ehci_qtd, qtd_list);
  433. last->hw_next = qtd->hw_next;
  434. }
  435. /* remove qtd; it's recycled after possible urb completion */
  436. list_del (&qtd->qtd_list);
  437. last = qtd;
  438. /* reinit the xacterr counter for the next qtd */
  439. qh->xacterrs = 0;
  440. }
  441. /* last urb's completion might still need calling */
  442. if (likely (last != NULL)) {
  443. ehci_urb_done(ehci, last->urb, last_status);
  444. count++;
  445. ehci_qtd_free (ehci, last);
  446. }
  447. /* Do we need to rescan for URBs dequeued during a giveback? */
  448. if (unlikely(qh->needs_rescan)) {
  449. /* If the QH is already unlinked, do the rescan now. */
  450. if (state == QH_STATE_IDLE)
  451. goto rescan;
  452. /* Otherwise we have to wait until the QH is fully unlinked.
  453. * Our caller will start an unlink if qh->needs_rescan is
  454. * set. But if an unlink has already started, nothing needs
  455. * to be done.
  456. */
  457. if (state != QH_STATE_LINKED)
  458. qh->needs_rescan = 0;
  459. }
  460. /* restore original state; caller must unlink or relink */
  461. qh->qh_state = state;
  462. /* be sure the hardware's done with the qh before refreshing
  463. * it after fault cleanup, or recovering from silicon wrongly
  464. * overlaying the dummy qtd (which reduces DMA chatter).
  465. */
  466. if (stopped != 0 || hw->hw_qtd_next == EHCI_LIST_END(ehci)) {
  467. switch (state) {
  468. case QH_STATE_IDLE:
  469. qh_refresh(ehci, qh);
  470. break;
  471. case QH_STATE_LINKED:
  472. /* We won't refresh a QH that's linked (after the HC
  473. * stopped the queue). That avoids a race:
  474. * - HC reads first part of QH;
  475. * - CPU updates that first part and the token;
  476. * - HC reads rest of that QH, including token
  477. * Result: HC gets an inconsistent image, and then
  478. * DMAs to/from the wrong memory (corrupting it).
  479. *
  480. * That should be rare for interrupt transfers,
  481. * except maybe high bandwidth ...
  482. */
  483. /* Tell the caller to start an unlink */
  484. qh->needs_rescan = 1;
  485. break;
  486. /* otherwise, unlink already started */
  487. }
  488. }
  489. return count;
  490. }
  491. /*-------------------------------------------------------------------------*/
  492. // high bandwidth multiplier, as encoded in highspeed endpoint descriptors
  493. #define hb_mult(wMaxPacketSize) (1 + (((wMaxPacketSize) >> 11) & 0x03))
  494. // ... and packet size, for any kind of endpoint descriptor
  495. #define max_packet(wMaxPacketSize) ((wMaxPacketSize) & 0x07ff)
  496. /*
  497. * reverse of qh_urb_transaction: free a list of TDs.
  498. * used for cleanup after errors, before HC sees an URB's TDs.
  499. */
  500. static void qtd_list_free (
  501. struct ehci_hcd *ehci,
  502. struct urb *urb,
  503. struct list_head *qtd_list
  504. ) {
  505. struct list_head *entry, *temp;
  506. list_for_each_safe (entry, temp, qtd_list) {
  507. struct ehci_qtd *qtd;
  508. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  509. list_del (&qtd->qtd_list);
  510. ehci_qtd_free (ehci, qtd);
  511. }
  512. }
  513. /*
  514. * create a list of filled qtds for this URB; won't link into qh.
  515. */
  516. static struct list_head *
  517. qh_urb_transaction (
  518. struct ehci_hcd *ehci,
  519. struct urb *urb,
  520. struct list_head *head,
  521. gfp_t flags
  522. ) {
  523. struct ehci_qtd *qtd, *qtd_prev;
  524. dma_addr_t buf;
  525. int len, maxpacket;
  526. int is_input;
  527. u32 token;
  528. /*
  529. * URBs map to sequences of QTDs: one logical transaction
  530. */
  531. qtd = ehci_qtd_alloc (ehci, flags);
  532. if (unlikely (!qtd))
  533. return NULL;
  534. list_add_tail (&qtd->qtd_list, head);
  535. qtd->urb = urb;
  536. token = QTD_STS_ACTIVE;
  537. token |= (EHCI_TUNE_CERR << 10);
  538. /* for split transactions, SplitXState initialized to zero */
  539. len = urb->transfer_buffer_length;
  540. is_input = usb_pipein (urb->pipe);
  541. if (usb_pipecontrol (urb->pipe)) {
  542. /* SETUP pid */
  543. qtd_fill(ehci, qtd, urb->setup_dma,
  544. sizeof (struct usb_ctrlrequest),
  545. token | (2 /* "setup" */ << 8), 8);
  546. /* ... and always at least one more pid */
  547. token ^= QTD_TOGGLE;
  548. qtd_prev = qtd;
  549. qtd = ehci_qtd_alloc (ehci, flags);
  550. if (unlikely (!qtd))
  551. goto cleanup;
  552. qtd->urb = urb;
  553. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  554. list_add_tail (&qtd->qtd_list, head);
  555. /* for zero length DATA stages, STATUS is always IN */
  556. if (len == 0)
  557. token |= (1 /* "in" */ << 8);
  558. }
  559. /*
  560. * data transfer stage: buffer setup
  561. */
  562. buf = urb->transfer_dma;
  563. if (is_input)
  564. token |= (1 /* "in" */ << 8);
  565. /* else it's already initted to "out" pid (0 << 8) */
  566. maxpacket = max_packet(usb_maxpacket(urb->dev, urb->pipe, !is_input));
  567. /*
  568. * buffer gets wrapped in one or more qtds;
  569. * last one may be "short" (including zero len)
  570. * and may serve as a control status ack
  571. */
  572. for (;;) {
  573. int this_qtd_len;
  574. this_qtd_len = qtd_fill(ehci, qtd, buf, len, token, maxpacket);
  575. len -= this_qtd_len;
  576. buf += this_qtd_len;
  577. /*
  578. * short reads advance to a "magic" dummy instead of the next
  579. * qtd ... that forces the queue to stop, for manual cleanup.
  580. * (this will usually be overridden later.)
  581. */
  582. if (is_input)
  583. qtd->hw_alt_next = ehci->async->hw->hw_alt_next;
  584. /* qh makes control packets use qtd toggle; maybe switch it */
  585. if ((maxpacket & (this_qtd_len + (maxpacket - 1))) == 0)
  586. token ^= QTD_TOGGLE;
  587. if (likely (len <= 0))
  588. break;
  589. qtd_prev = qtd;
  590. qtd = ehci_qtd_alloc (ehci, flags);
  591. if (unlikely (!qtd))
  592. goto cleanup;
  593. qtd->urb = urb;
  594. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  595. list_add_tail (&qtd->qtd_list, head);
  596. }
  597. /*
  598. * unless the caller requires manual cleanup after short reads,
  599. * have the alt_next mechanism keep the queue running after the
  600. * last data qtd (the only one, for control and most other cases).
  601. */
  602. if (likely ((urb->transfer_flags & URB_SHORT_NOT_OK) == 0
  603. || usb_pipecontrol (urb->pipe)))
  604. qtd->hw_alt_next = EHCI_LIST_END(ehci);
  605. /*
  606. * control requests may need a terminating data "status" ack;
  607. * bulk ones may need a terminating short packet (zero length).
  608. */
  609. if (likely (urb->transfer_buffer_length != 0)) {
  610. int one_more = 0;
  611. if (usb_pipecontrol (urb->pipe)) {
  612. one_more = 1;
  613. token ^= 0x0100; /* "in" <--> "out" */
  614. token |= QTD_TOGGLE; /* force DATA1 */
  615. } else if (usb_pipebulk (urb->pipe)
  616. && (urb->transfer_flags & URB_ZERO_PACKET)
  617. && !(urb->transfer_buffer_length % maxpacket)) {
  618. one_more = 1;
  619. }
  620. if (one_more) {
  621. qtd_prev = qtd;
  622. qtd = ehci_qtd_alloc (ehci, flags);
  623. if (unlikely (!qtd))
  624. goto cleanup;
  625. qtd->urb = urb;
  626. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  627. list_add_tail (&qtd->qtd_list, head);
  628. /* never any data in such packets */
  629. qtd_fill(ehci, qtd, 0, 0, token, 0);
  630. }
  631. }
  632. /* by default, enable interrupt on urb completion */
  633. if (likely (!(urb->transfer_flags & URB_NO_INTERRUPT)))
  634. qtd->hw_token |= cpu_to_hc32(ehci, QTD_IOC);
  635. return head;
  636. cleanup:
  637. qtd_list_free (ehci, urb, head);
  638. return NULL;
  639. }
  640. /*-------------------------------------------------------------------------*/
  641. // Would be best to create all qh's from config descriptors,
  642. // when each interface/altsetting is established. Unlink
  643. // any previous qh and cancel its urbs first; endpoints are
  644. // implicitly reset then (data toggle too).
  645. // That'd mean updating how usbcore talks to HCDs. (2.7?)
  646. /*
  647. * Each QH holds a qtd list; a QH is used for everything except iso.
  648. *
  649. * For interrupt urbs, the scheduler must set the microframe scheduling
  650. * mask(s) each time the QH gets scheduled. For highspeed, that's
  651. * just one microframe in the s-mask. For split interrupt transactions
  652. * there are additional complications: c-mask, maybe FSTNs.
  653. */
  654. static struct ehci_qh *
  655. qh_make (
  656. struct ehci_hcd *ehci,
  657. struct urb *urb,
  658. gfp_t flags
  659. ) {
  660. struct ehci_qh *qh = ehci_qh_alloc (ehci, flags);
  661. u32 info1 = 0, info2 = 0;
  662. int is_input, type;
  663. int maxp = 0;
  664. struct usb_tt *tt = urb->dev->tt;
  665. struct ehci_qh_hw *hw;
  666. if (!qh)
  667. return qh;
  668. /*
  669. * init endpoint/device data for this QH
  670. */
  671. info1 |= usb_pipeendpoint (urb->pipe) << 8;
  672. info1 |= usb_pipedevice (urb->pipe) << 0;
  673. is_input = usb_pipein (urb->pipe);
  674. type = usb_pipetype (urb->pipe);
  675. maxp = usb_maxpacket (urb->dev, urb->pipe, !is_input);
  676. /* 1024 byte maxpacket is a hardware ceiling. High bandwidth
  677. * acts like up to 3KB, but is built from smaller packets.
  678. */
  679. if (max_packet(maxp) > 1024) {
  680. ehci_dbg(ehci, "bogus qh maxpacket %d\n", max_packet(maxp));
  681. goto done;
  682. }
  683. /* Compute interrupt scheduling parameters just once, and save.
  684. * - allowing for high bandwidth, how many nsec/uframe are used?
  685. * - split transactions need a second CSPLIT uframe; same question
  686. * - splits also need a schedule gap (for full/low speed I/O)
  687. * - qh has a polling interval
  688. *
  689. * For control/bulk requests, the HC or TT handles these.
  690. */
  691. if (type == PIPE_INTERRUPT) {
  692. qh->usecs = NS_TO_US(usb_calc_bus_time(USB_SPEED_HIGH,
  693. is_input, 0,
  694. hb_mult(maxp) * max_packet(maxp)));
  695. qh->start = NO_FRAME;
  696. if (urb->dev->speed == USB_SPEED_HIGH) {
  697. qh->c_usecs = 0;
  698. qh->gap_uf = 0;
  699. qh->period = urb->interval >> 3;
  700. if (qh->period == 0 && urb->interval != 1) {
  701. /* NOTE interval 2 or 4 uframes could work.
  702. * But interval 1 scheduling is simpler, and
  703. * includes high bandwidth.
  704. */
  705. dbg ("intr period %d uframes, NYET!",
  706. urb->interval);
  707. goto done;
  708. }
  709. } else {
  710. int think_time;
  711. /* gap is f(FS/LS transfer times) */
  712. qh->gap_uf = 1 + usb_calc_bus_time (urb->dev->speed,
  713. is_input, 0, maxp) / (125 * 1000);
  714. /* FIXME this just approximates SPLIT/CSPLIT times */
  715. if (is_input) { // SPLIT, gap, CSPLIT+DATA
  716. qh->c_usecs = qh->usecs + HS_USECS (0);
  717. qh->usecs = HS_USECS (1);
  718. } else { // SPLIT+DATA, gap, CSPLIT
  719. qh->usecs += HS_USECS (1);
  720. qh->c_usecs = HS_USECS (0);
  721. }
  722. think_time = tt ? tt->think_time : 0;
  723. qh->tt_usecs = NS_TO_US (think_time +
  724. usb_calc_bus_time (urb->dev->speed,
  725. is_input, 0, max_packet (maxp)));
  726. qh->period = urb->interval;
  727. }
  728. }
  729. /* support for tt scheduling, and access to toggles */
  730. qh->dev = urb->dev;
  731. /* using TT? */
  732. switch (urb->dev->speed) {
  733. case USB_SPEED_LOW:
  734. info1 |= (1 << 12); /* EPS "low" */
  735. /* FALL THROUGH */
  736. case USB_SPEED_FULL:
  737. /* EPS 0 means "full" */
  738. if (type != PIPE_INTERRUPT)
  739. info1 |= (EHCI_TUNE_RL_TT << 28);
  740. if (type == PIPE_CONTROL) {
  741. info1 |= (1 << 27); /* for TT */
  742. info1 |= 1 << 14; /* toggle from qtd */
  743. }
  744. info1 |= maxp << 16;
  745. info2 |= (EHCI_TUNE_MULT_TT << 30);
  746. /* Some Freescale processors have an erratum in which the
  747. * port number in the queue head was 0..N-1 instead of 1..N.
  748. */
  749. if (ehci_has_fsl_portno_bug(ehci))
  750. info2 |= (urb->dev->ttport-1) << 23;
  751. else
  752. info2 |= urb->dev->ttport << 23;
  753. /* set the address of the TT; for TDI's integrated
  754. * root hub tt, leave it zeroed.
  755. */
  756. if (tt && tt->hub != ehci_to_hcd(ehci)->self.root_hub)
  757. info2 |= tt->hub->devnum << 16;
  758. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets c-mask } */
  759. break;
  760. case USB_SPEED_HIGH: /* no TT involved */
  761. info1 |= (2 << 12); /* EPS "high" */
  762. if (type == PIPE_CONTROL) {
  763. info1 |= (EHCI_TUNE_RL_HS << 28);
  764. info1 |= 64 << 16; /* usb2 fixed maxpacket */
  765. info1 |= 1 << 14; /* toggle from qtd */
  766. info2 |= (EHCI_TUNE_MULT_HS << 30);
  767. } else if (type == PIPE_BULK) {
  768. info1 |= (EHCI_TUNE_RL_HS << 28);
  769. /* The USB spec says that high speed bulk endpoints
  770. * always use 512 byte maxpacket. But some device
  771. * vendors decided to ignore that, and MSFT is happy
  772. * to help them do so. So now people expect to use
  773. * such nonconformant devices with Linux too; sigh.
  774. */
  775. info1 |= max_packet(maxp) << 16;
  776. info2 |= (EHCI_TUNE_MULT_HS << 30);
  777. } else { /* PIPE_INTERRUPT */
  778. info1 |= max_packet (maxp) << 16;
  779. info2 |= hb_mult (maxp) << 30;
  780. }
  781. break;
  782. default:
  783. dbg ("bogus dev %p speed %d", urb->dev, urb->dev->speed);
  784. done:
  785. qh_put (qh);
  786. return NULL;
  787. }
  788. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets s-mask } */
  789. /* init as live, toggle clear, advance to dummy */
  790. qh->qh_state = QH_STATE_IDLE;
  791. hw = qh->hw;
  792. hw->hw_info1 = cpu_to_hc32(ehci, info1);
  793. hw->hw_info2 = cpu_to_hc32(ehci, info2);
  794. usb_settoggle (urb->dev, usb_pipeendpoint (urb->pipe), !is_input, 1);
  795. qh_refresh (ehci, qh);
  796. return qh;
  797. }
  798. /*-------------------------------------------------------------------------*/
  799. /* move qh (and its qtds) onto async queue; maybe enable queue. */
  800. static void qh_link_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  801. {
  802. __hc32 dma = QH_NEXT(ehci, qh->qh_dma);
  803. struct ehci_qh *head;
  804. /* Don't link a QH if there's a Clear-TT-Buffer pending */
  805. if (unlikely(qh->clearing_tt))
  806. return;
  807. WARN_ON(qh->qh_state != QH_STATE_IDLE);
  808. /* (re)start the async schedule? */
  809. head = ehci->async;
  810. timer_action_done (ehci, TIMER_ASYNC_OFF);
  811. if (!head->qh_next.qh) {
  812. u32 cmd = ehci_readl(ehci, &ehci->regs->command);
  813. if (!(cmd & CMD_ASE)) {
  814. /* in case a clear of CMD_ASE didn't take yet */
  815. (void)handshake(ehci, &ehci->regs->status,
  816. STS_ASS, 0, 150);
  817. cmd |= CMD_ASE | CMD_RUN;
  818. ehci_writel(ehci, cmd, &ehci->regs->command);
  819. ehci_to_hcd(ehci)->state = HC_STATE_RUNNING;
  820. /* posted write need not be known to HC yet ... */
  821. }
  822. }
  823. /* clear halt and/or toggle; and maybe recover from silicon quirk */
  824. qh_refresh(ehci, qh);
  825. /* splice right after start */
  826. qh->qh_next = head->qh_next;
  827. qh->hw->hw_next = head->hw->hw_next;
  828. wmb ();
  829. head->qh_next.qh = qh;
  830. head->hw->hw_next = dma;
  831. qh_get(qh);
  832. qh->xacterrs = 0;
  833. qh->qh_state = QH_STATE_LINKED;
  834. /* qtd completions reported later by interrupt */
  835. }
  836. /*-------------------------------------------------------------------------*/
  837. /*
  838. * For control/bulk/interrupt, return QH with these TDs appended.
  839. * Allocates and initializes the QH if necessary.
  840. * Returns null if it can't allocate a QH it needs to.
  841. * If the QH has TDs (urbs) already, that's great.
  842. */
  843. static struct ehci_qh *qh_append_tds (
  844. struct ehci_hcd *ehci,
  845. struct urb *urb,
  846. struct list_head *qtd_list,
  847. int epnum,
  848. void **ptr
  849. )
  850. {
  851. struct ehci_qh *qh = NULL;
  852. __hc32 qh_addr_mask = cpu_to_hc32(ehci, 0x7f);
  853. qh = (struct ehci_qh *) *ptr;
  854. if (unlikely (qh == NULL)) {
  855. /* can't sleep here, we have ehci->lock... */
  856. qh = qh_make (ehci, urb, GFP_ATOMIC);
  857. *ptr = qh;
  858. }
  859. if (likely (qh != NULL)) {
  860. struct ehci_qtd *qtd;
  861. if (unlikely (list_empty (qtd_list)))
  862. qtd = NULL;
  863. else
  864. qtd = list_entry (qtd_list->next, struct ehci_qtd,
  865. qtd_list);
  866. /* control qh may need patching ... */
  867. if (unlikely (epnum == 0)) {
  868. /* usb_reset_device() briefly reverts to address 0 */
  869. if (usb_pipedevice (urb->pipe) == 0)
  870. qh->hw->hw_info1 &= ~qh_addr_mask;
  871. }
  872. /* just one way to queue requests: swap with the dummy qtd.
  873. * only hc or qh_refresh() ever modify the overlay.
  874. */
  875. if (likely (qtd != NULL)) {
  876. struct ehci_qtd *dummy;
  877. dma_addr_t dma;
  878. __hc32 token;
  879. /* to avoid racing the HC, use the dummy td instead of
  880. * the first td of our list (becomes new dummy). both
  881. * tds stay deactivated until we're done, when the
  882. * HC is allowed to fetch the old dummy (4.10.2).
  883. */
  884. token = qtd->hw_token;
  885. qtd->hw_token = HALT_BIT(ehci);
  886. wmb ();
  887. dummy = qh->dummy;
  888. dma = dummy->qtd_dma;
  889. *dummy = *qtd;
  890. dummy->qtd_dma = dma;
  891. list_del (&qtd->qtd_list);
  892. list_add (&dummy->qtd_list, qtd_list);
  893. list_splice_tail(qtd_list, &qh->qtd_list);
  894. ehci_qtd_init(ehci, qtd, qtd->qtd_dma);
  895. qh->dummy = qtd;
  896. /* hc must see the new dummy at list end */
  897. dma = qtd->qtd_dma;
  898. qtd = list_entry (qh->qtd_list.prev,
  899. struct ehci_qtd, qtd_list);
  900. qtd->hw_next = QTD_NEXT(ehci, dma);
  901. /* let the hc process these next qtds */
  902. wmb ();
  903. dummy->hw_token = token;
  904. urb->hcpriv = qh_get (qh);
  905. }
  906. }
  907. return qh;
  908. }
  909. /*-------------------------------------------------------------------------*/
  910. static int
  911. submit_async (
  912. struct ehci_hcd *ehci,
  913. struct urb *urb,
  914. struct list_head *qtd_list,
  915. gfp_t mem_flags
  916. ) {
  917. struct ehci_qtd *qtd;
  918. int epnum;
  919. unsigned long flags;
  920. struct ehci_qh *qh = NULL;
  921. int rc;
  922. qtd = list_entry (qtd_list->next, struct ehci_qtd, qtd_list);
  923. epnum = urb->ep->desc.bEndpointAddress;
  924. #ifdef EHCI_URB_TRACE
  925. ehci_dbg (ehci,
  926. "%s %s urb %p ep%d%s len %d, qtd %p [qh %p]\n",
  927. __func__, urb->dev->devpath, urb,
  928. epnum & 0x0f, (epnum & USB_DIR_IN) ? "in" : "out",
  929. urb->transfer_buffer_length,
  930. qtd, urb->ep->hcpriv);
  931. #endif
  932. spin_lock_irqsave (&ehci->lock, flags);
  933. if (unlikely(!test_bit(HCD_FLAG_HW_ACCESSIBLE,
  934. &ehci_to_hcd(ehci)->flags))) {
  935. rc = -ESHUTDOWN;
  936. goto done;
  937. }
  938. rc = usb_hcd_link_urb_to_ep(ehci_to_hcd(ehci), urb);
  939. if (unlikely(rc))
  940. goto done;
  941. qh = qh_append_tds(ehci, urb, qtd_list, epnum, &urb->ep->hcpriv);
  942. if (unlikely(qh == NULL)) {
  943. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  944. rc = -ENOMEM;
  945. goto done;
  946. }
  947. /* Control/bulk operations through TTs don't need scheduling,
  948. * the HC and TT handle it when the TT has a buffer ready.
  949. */
  950. if (likely (qh->qh_state == QH_STATE_IDLE))
  951. qh_link_async(ehci, qh);
  952. done:
  953. spin_unlock_irqrestore (&ehci->lock, flags);
  954. if (unlikely (qh == NULL))
  955. qtd_list_free (ehci, urb, qtd_list);
  956. return rc;
  957. }
  958. /*-------------------------------------------------------------------------*/
  959. /* the async qh for the qtds being reclaimed are now unlinked from the HC */
  960. static void end_unlink_async (struct ehci_hcd *ehci)
  961. {
  962. struct ehci_qh *qh = ehci->reclaim;
  963. struct ehci_qh *next;
  964. iaa_watchdog_done(ehci);
  965. // qh->hw_next = cpu_to_hc32(qh->qh_dma);
  966. qh->qh_state = QH_STATE_IDLE;
  967. qh->qh_next.qh = NULL;
  968. qh_put (qh); // refcount from reclaim
  969. /* other unlink(s) may be pending (in QH_STATE_UNLINK_WAIT) */
  970. next = qh->reclaim;
  971. ehci->reclaim = next;
  972. qh->reclaim = NULL;
  973. qh_completions (ehci, qh);
  974. if (!list_empty (&qh->qtd_list)
  975. && HC_IS_RUNNING (ehci_to_hcd(ehci)->state))
  976. qh_link_async (ehci, qh);
  977. else {
  978. /* it's not free to turn the async schedule on/off; leave it
  979. * active but idle for a while once it empties.
  980. */
  981. if (HC_IS_RUNNING (ehci_to_hcd(ehci)->state)
  982. && ehci->async->qh_next.qh == NULL)
  983. timer_action (ehci, TIMER_ASYNC_OFF);
  984. }
  985. qh_put(qh); /* refcount from async list */
  986. if (next) {
  987. ehci->reclaim = NULL;
  988. start_unlink_async (ehci, next);
  989. }
  990. }
  991. /* makes sure the async qh will become idle */
  992. /* caller must own ehci->lock */
  993. static void start_unlink_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  994. {
  995. int cmd = ehci_readl(ehci, &ehci->regs->command);
  996. struct ehci_qh *prev;
  997. #ifdef DEBUG
  998. assert_spin_locked(&ehci->lock);
  999. if (ehci->reclaim
  1000. || (qh->qh_state != QH_STATE_LINKED
  1001. && qh->qh_state != QH_STATE_UNLINK_WAIT)
  1002. )
  1003. BUG ();
  1004. #endif
  1005. /* stop async schedule right now? */
  1006. if (unlikely (qh == ehci->async)) {
  1007. /* can't get here without STS_ASS set */
  1008. if (ehci_to_hcd(ehci)->state != HC_STATE_HALT
  1009. && !ehci->reclaim) {
  1010. /* ... and CMD_IAAD clear */
  1011. ehci_writel(ehci, cmd & ~CMD_ASE,
  1012. &ehci->regs->command);
  1013. wmb ();
  1014. // handshake later, if we need to
  1015. timer_action_done (ehci, TIMER_ASYNC_OFF);
  1016. }
  1017. return;
  1018. }
  1019. qh->qh_state = QH_STATE_UNLINK;
  1020. ehci->reclaim = qh = qh_get (qh);
  1021. prev = ehci->async;
  1022. while (prev->qh_next.qh != qh)
  1023. prev = prev->qh_next.qh;
  1024. prev->hw->hw_next = qh->hw->hw_next;
  1025. prev->qh_next = qh->qh_next;
  1026. wmb ();
  1027. /* If the controller isn't running, we don't have to wait for it */
  1028. if (unlikely(!HC_IS_RUNNING(ehci_to_hcd(ehci)->state))) {
  1029. /* if (unlikely (qh->reclaim != 0))
  1030. * this will recurse, probably not much
  1031. */
  1032. end_unlink_async (ehci);
  1033. return;
  1034. }
  1035. cmd |= CMD_IAAD;
  1036. ehci_writel(ehci, cmd, &ehci->regs->command);
  1037. (void)ehci_readl(ehci, &ehci->regs->command);
  1038. iaa_watchdog_start(ehci);
  1039. }
  1040. /*-------------------------------------------------------------------------*/
  1041. static void scan_async (struct ehci_hcd *ehci)
  1042. {
  1043. struct ehci_qh *qh;
  1044. enum ehci_timer_action action = TIMER_IO_WATCHDOG;
  1045. ehci->stamp = ehci_readl(ehci, &ehci->regs->frame_index);
  1046. timer_action_done (ehci, TIMER_ASYNC_SHRINK);
  1047. rescan:
  1048. qh = ehci->async->qh_next.qh;
  1049. if (likely (qh != NULL)) {
  1050. do {
  1051. /* clean any finished work for this qh */
  1052. if (!list_empty (&qh->qtd_list)
  1053. && qh->stamp != ehci->stamp) {
  1054. int temp;
  1055. /* unlinks could happen here; completion
  1056. * reporting drops the lock. rescan using
  1057. * the latest schedule, but don't rescan
  1058. * qhs we already finished (no looping).
  1059. */
  1060. qh = qh_get (qh);
  1061. qh->stamp = ehci->stamp;
  1062. temp = qh_completions (ehci, qh);
  1063. if (qh->needs_rescan)
  1064. unlink_async(ehci, qh);
  1065. qh_put (qh);
  1066. if (temp != 0) {
  1067. goto rescan;
  1068. }
  1069. }
  1070. /* unlink idle entries, reducing DMA usage as well
  1071. * as HCD schedule-scanning costs. delay for any qh
  1072. * we just scanned, there's a not-unusual case that it
  1073. * doesn't stay idle for long.
  1074. * (plus, avoids some kind of re-activation race.)
  1075. */
  1076. if (list_empty(&qh->qtd_list)
  1077. && qh->qh_state == QH_STATE_LINKED) {
  1078. if (!ehci->reclaim
  1079. && ((ehci->stamp - qh->stamp) & 0x1fff)
  1080. >= (EHCI_SHRINK_FRAMES * 8))
  1081. start_unlink_async(ehci, qh);
  1082. else
  1083. action = TIMER_ASYNC_SHRINK;
  1084. }
  1085. qh = qh->qh_next.qh;
  1086. } while (qh);
  1087. }
  1088. if (action == TIMER_ASYNC_SHRINK)
  1089. timer_action (ehci, TIMER_ASYNC_SHRINK);
  1090. }