ehci-q.c 35 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250
  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 void intr_deschedule (struct ehci_hcd *ehci, struct ehci_qh *qh);
  260. static int qh_schedule (struct ehci_hcd *ehci, struct ehci_qh *qh);
  261. /*
  262. * Process and free completed qtds for a qh, returning URBs to drivers.
  263. * Chases up to qh->hw_current. Returns number of completions called,
  264. * indicating how much "real" work we did.
  265. */
  266. static unsigned
  267. qh_completions (struct ehci_hcd *ehci, struct ehci_qh *qh)
  268. {
  269. struct ehci_qtd *last = NULL, *end = qh->dummy;
  270. struct list_head *entry, *tmp;
  271. int last_status = -EINPROGRESS;
  272. int stopped;
  273. unsigned count = 0;
  274. u8 state;
  275. __le32 halt = HALT_BIT(ehci);
  276. struct ehci_qh_hw *hw = qh->hw;
  277. if (unlikely (list_empty (&qh->qtd_list)))
  278. return count;
  279. /* completions (or tasks on other cpus) must never clobber HALT
  280. * till we've gone through and cleaned everything up, even when
  281. * they add urbs to this qh's queue or mark them for unlinking.
  282. *
  283. * NOTE: unlinking expects to be done in queue order.
  284. */
  285. state = qh->qh_state;
  286. qh->qh_state = QH_STATE_COMPLETING;
  287. stopped = (state == QH_STATE_IDLE);
  288. /* remove de-activated QTDs from front of queue.
  289. * after faults (including short reads), cleanup this urb
  290. * then let the queue advance.
  291. * if queue is stopped, handles unlinks.
  292. */
  293. list_for_each_safe (entry, tmp, &qh->qtd_list) {
  294. struct ehci_qtd *qtd;
  295. struct urb *urb;
  296. u32 token = 0;
  297. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  298. urb = qtd->urb;
  299. /* clean up any state from previous QTD ...*/
  300. if (last) {
  301. if (likely (last->urb != urb)) {
  302. ehci_urb_done(ehci, last->urb, last_status);
  303. count++;
  304. last_status = -EINPROGRESS;
  305. }
  306. ehci_qtd_free (ehci, last);
  307. last = NULL;
  308. }
  309. /* ignore urbs submitted during completions we reported */
  310. if (qtd == end)
  311. break;
  312. /* hardware copies qtd out of qh overlay */
  313. rmb ();
  314. token = hc32_to_cpu(ehci, qtd->hw_token);
  315. /* always clean up qtds the hc de-activated */
  316. retry_xacterr:
  317. if ((token & QTD_STS_ACTIVE) == 0) {
  318. /* on STALL, error, and short reads this urb must
  319. * complete and all its qtds must be recycled.
  320. */
  321. if ((token & QTD_STS_HALT) != 0) {
  322. /* retry transaction errors until we
  323. * reach the software xacterr limit
  324. */
  325. if ((token & QTD_STS_XACT) &&
  326. QTD_CERR(token) == 0 &&
  327. ++qh->xacterrs < QH_XACTERR_MAX &&
  328. !urb->unlinked) {
  329. ehci_dbg(ehci,
  330. "detected XactErr len %zu/%zu retry %d\n",
  331. qtd->length - QTD_LENGTH(token), qtd->length, qh->xacterrs);
  332. /* reset the token in the qtd and the
  333. * qh overlay (which still contains
  334. * the qtd) so that we pick up from
  335. * where we left off
  336. */
  337. token &= ~QTD_STS_HALT;
  338. token |= QTD_STS_ACTIVE |
  339. (EHCI_TUNE_CERR << 10);
  340. qtd->hw_token = cpu_to_hc32(ehci,
  341. token);
  342. wmb();
  343. hw->hw_token = cpu_to_hc32(ehci,
  344. token);
  345. goto retry_xacterr;
  346. }
  347. stopped = 1;
  348. /* magic dummy for some short reads; qh won't advance.
  349. * that silicon quirk can kick in with this dummy too.
  350. *
  351. * other short reads won't stop the queue, including
  352. * control transfers (status stage handles that) or
  353. * most other single-qtd reads ... the queue stops if
  354. * URB_SHORT_NOT_OK was set so the driver submitting
  355. * the urbs could clean it up.
  356. */
  357. } else if (IS_SHORT_READ (token)
  358. && !(qtd->hw_alt_next
  359. & EHCI_LIST_END(ehci))) {
  360. stopped = 1;
  361. goto halt;
  362. }
  363. /* stop scanning when we reach qtds the hc is using */
  364. } else if (likely (!stopped
  365. && HC_IS_RUNNING (ehci_to_hcd(ehci)->state))) {
  366. break;
  367. /* scan the whole queue for unlinks whenever it stops */
  368. } else {
  369. stopped = 1;
  370. /* cancel everything if we halt, suspend, etc */
  371. if (!HC_IS_RUNNING(ehci_to_hcd(ehci)->state))
  372. last_status = -ESHUTDOWN;
  373. /* this qtd is active; skip it unless a previous qtd
  374. * for its urb faulted, or its urb was canceled.
  375. */
  376. else if (last_status == -EINPROGRESS && !urb->unlinked)
  377. continue;
  378. /* qh unlinked; token in overlay may be most current */
  379. if (state == QH_STATE_IDLE
  380. && cpu_to_hc32(ehci, qtd->qtd_dma)
  381. == hw->hw_current) {
  382. token = hc32_to_cpu(ehci, hw->hw_token);
  383. /* An unlink may leave an incomplete
  384. * async transaction in the TT buffer.
  385. * We have to clear it.
  386. */
  387. ehci_clear_tt_buffer(ehci, qh, urb, token);
  388. }
  389. /* force halt for unlinked or blocked qh, so we'll
  390. * patch the qh later and so that completions can't
  391. * activate it while we "know" it's stopped.
  392. */
  393. if ((halt & hw->hw_token) == 0) {
  394. halt:
  395. hw->hw_token |= halt;
  396. wmb ();
  397. }
  398. }
  399. /* unless we already know the urb's status, collect qtd status
  400. * and update count of bytes transferred. in common short read
  401. * cases with only one data qtd (including control transfers),
  402. * queue processing won't halt. but with two or more qtds (for
  403. * example, with a 32 KB transfer), when the first qtd gets a
  404. * short read the second must be removed by hand.
  405. */
  406. if (last_status == -EINPROGRESS) {
  407. last_status = qtd_copy_status(ehci, urb,
  408. qtd->length, token);
  409. if (last_status == -EREMOTEIO
  410. && (qtd->hw_alt_next
  411. & EHCI_LIST_END(ehci)))
  412. last_status = -EINPROGRESS;
  413. /* As part of low/full-speed endpoint-halt processing
  414. * we must clear the TT buffer (11.17.5).
  415. */
  416. if (unlikely(last_status != -EINPROGRESS &&
  417. last_status != -EREMOTEIO))
  418. ehci_clear_tt_buffer(ehci, qh, urb, token);
  419. }
  420. /* if we're removing something not at the queue head,
  421. * patch the hardware queue pointer.
  422. */
  423. if (stopped && qtd->qtd_list.prev != &qh->qtd_list) {
  424. last = list_entry (qtd->qtd_list.prev,
  425. struct ehci_qtd, qtd_list);
  426. last->hw_next = qtd->hw_next;
  427. }
  428. /* remove qtd; it's recycled after possible urb completion */
  429. list_del (&qtd->qtd_list);
  430. last = qtd;
  431. /* reinit the xacterr counter for the next qtd */
  432. qh->xacterrs = 0;
  433. }
  434. /* last urb's completion might still need calling */
  435. if (likely (last != NULL)) {
  436. ehci_urb_done(ehci, last->urb, last_status);
  437. count++;
  438. ehci_qtd_free (ehci, last);
  439. }
  440. /* restore original state; caller must unlink or relink */
  441. qh->qh_state = state;
  442. /* be sure the hardware's done with the qh before refreshing
  443. * it after fault cleanup, or recovering from silicon wrongly
  444. * overlaying the dummy qtd (which reduces DMA chatter).
  445. */
  446. if (stopped != 0 || hw->hw_qtd_next == EHCI_LIST_END(ehci)) {
  447. switch (state) {
  448. case QH_STATE_IDLE:
  449. qh_refresh(ehci, qh);
  450. break;
  451. case QH_STATE_LINKED:
  452. /* We won't refresh a QH that's linked (after the HC
  453. * stopped the queue). That avoids a race:
  454. * - HC reads first part of QH;
  455. * - CPU updates that first part and the token;
  456. * - HC reads rest of that QH, including token
  457. * Result: HC gets an inconsistent image, and then
  458. * DMAs to/from the wrong memory (corrupting it).
  459. *
  460. * That should be rare for interrupt transfers,
  461. * except maybe high bandwidth ...
  462. */
  463. if ((cpu_to_hc32(ehci, QH_SMASK)
  464. & hw->hw_info2) != 0) {
  465. intr_deschedule (ehci, qh);
  466. (void) qh_schedule (ehci, qh);
  467. } else
  468. unlink_async (ehci, qh);
  469. break;
  470. /* otherwise, unlink already started */
  471. }
  472. }
  473. return count;
  474. }
  475. /*-------------------------------------------------------------------------*/
  476. // high bandwidth multiplier, as encoded in highspeed endpoint descriptors
  477. #define hb_mult(wMaxPacketSize) (1 + (((wMaxPacketSize) >> 11) & 0x03))
  478. // ... and packet size, for any kind of endpoint descriptor
  479. #define max_packet(wMaxPacketSize) ((wMaxPacketSize) & 0x07ff)
  480. /*
  481. * reverse of qh_urb_transaction: free a list of TDs.
  482. * used for cleanup after errors, before HC sees an URB's TDs.
  483. */
  484. static void qtd_list_free (
  485. struct ehci_hcd *ehci,
  486. struct urb *urb,
  487. struct list_head *qtd_list
  488. ) {
  489. struct list_head *entry, *temp;
  490. list_for_each_safe (entry, temp, qtd_list) {
  491. struct ehci_qtd *qtd;
  492. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  493. list_del (&qtd->qtd_list);
  494. ehci_qtd_free (ehci, qtd);
  495. }
  496. }
  497. /*
  498. * create a list of filled qtds for this URB; won't link into qh.
  499. */
  500. static struct list_head *
  501. qh_urb_transaction (
  502. struct ehci_hcd *ehci,
  503. struct urb *urb,
  504. struct list_head *head,
  505. gfp_t flags
  506. ) {
  507. struct ehci_qtd *qtd, *qtd_prev;
  508. dma_addr_t buf;
  509. int len, maxpacket;
  510. int is_input;
  511. u32 token;
  512. /*
  513. * URBs map to sequences of QTDs: one logical transaction
  514. */
  515. qtd = ehci_qtd_alloc (ehci, flags);
  516. if (unlikely (!qtd))
  517. return NULL;
  518. list_add_tail (&qtd->qtd_list, head);
  519. qtd->urb = urb;
  520. token = QTD_STS_ACTIVE;
  521. token |= (EHCI_TUNE_CERR << 10);
  522. /* for split transactions, SplitXState initialized to zero */
  523. len = urb->transfer_buffer_length;
  524. is_input = usb_pipein (urb->pipe);
  525. if (usb_pipecontrol (urb->pipe)) {
  526. /* SETUP pid */
  527. qtd_fill(ehci, qtd, urb->setup_dma,
  528. sizeof (struct usb_ctrlrequest),
  529. token | (2 /* "setup" */ << 8), 8);
  530. /* ... and always at least one more pid */
  531. token ^= QTD_TOGGLE;
  532. qtd_prev = qtd;
  533. qtd = ehci_qtd_alloc (ehci, flags);
  534. if (unlikely (!qtd))
  535. goto cleanup;
  536. qtd->urb = urb;
  537. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  538. list_add_tail (&qtd->qtd_list, head);
  539. /* for zero length DATA stages, STATUS is always IN */
  540. if (len == 0)
  541. token |= (1 /* "in" */ << 8);
  542. }
  543. /*
  544. * data transfer stage: buffer setup
  545. */
  546. buf = urb->transfer_dma;
  547. if (is_input)
  548. token |= (1 /* "in" */ << 8);
  549. /* else it's already initted to "out" pid (0 << 8) */
  550. maxpacket = max_packet(usb_maxpacket(urb->dev, urb->pipe, !is_input));
  551. /*
  552. * buffer gets wrapped in one or more qtds;
  553. * last one may be "short" (including zero len)
  554. * and may serve as a control status ack
  555. */
  556. for (;;) {
  557. int this_qtd_len;
  558. this_qtd_len = qtd_fill(ehci, qtd, buf, len, token, maxpacket);
  559. len -= this_qtd_len;
  560. buf += this_qtd_len;
  561. /*
  562. * short reads advance to a "magic" dummy instead of the next
  563. * qtd ... that forces the queue to stop, for manual cleanup.
  564. * (this will usually be overridden later.)
  565. */
  566. if (is_input)
  567. qtd->hw_alt_next = ehci->async->hw->hw_alt_next;
  568. /* qh makes control packets use qtd toggle; maybe switch it */
  569. if ((maxpacket & (this_qtd_len + (maxpacket - 1))) == 0)
  570. token ^= QTD_TOGGLE;
  571. if (likely (len <= 0))
  572. break;
  573. qtd_prev = qtd;
  574. qtd = ehci_qtd_alloc (ehci, flags);
  575. if (unlikely (!qtd))
  576. goto cleanup;
  577. qtd->urb = urb;
  578. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  579. list_add_tail (&qtd->qtd_list, head);
  580. }
  581. /*
  582. * unless the caller requires manual cleanup after short reads,
  583. * have the alt_next mechanism keep the queue running after the
  584. * last data qtd (the only one, for control and most other cases).
  585. */
  586. if (likely ((urb->transfer_flags & URB_SHORT_NOT_OK) == 0
  587. || usb_pipecontrol (urb->pipe)))
  588. qtd->hw_alt_next = EHCI_LIST_END(ehci);
  589. /*
  590. * control requests may need a terminating data "status" ack;
  591. * bulk ones may need a terminating short packet (zero length).
  592. */
  593. if (likely (urb->transfer_buffer_length != 0)) {
  594. int one_more = 0;
  595. if (usb_pipecontrol (urb->pipe)) {
  596. one_more = 1;
  597. token ^= 0x0100; /* "in" <--> "out" */
  598. token |= QTD_TOGGLE; /* force DATA1 */
  599. } else if (usb_pipebulk (urb->pipe)
  600. && (urb->transfer_flags & URB_ZERO_PACKET)
  601. && !(urb->transfer_buffer_length % maxpacket)) {
  602. one_more = 1;
  603. }
  604. if (one_more) {
  605. qtd_prev = qtd;
  606. qtd = ehci_qtd_alloc (ehci, flags);
  607. if (unlikely (!qtd))
  608. goto cleanup;
  609. qtd->urb = urb;
  610. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  611. list_add_tail (&qtd->qtd_list, head);
  612. /* never any data in such packets */
  613. qtd_fill(ehci, qtd, 0, 0, token, 0);
  614. }
  615. }
  616. /* by default, enable interrupt on urb completion */
  617. if (likely (!(urb->transfer_flags & URB_NO_INTERRUPT)))
  618. qtd->hw_token |= cpu_to_hc32(ehci, QTD_IOC);
  619. return head;
  620. cleanup:
  621. qtd_list_free (ehci, urb, head);
  622. return NULL;
  623. }
  624. /*-------------------------------------------------------------------------*/
  625. // Would be best to create all qh's from config descriptors,
  626. // when each interface/altsetting is established. Unlink
  627. // any previous qh and cancel its urbs first; endpoints are
  628. // implicitly reset then (data toggle too).
  629. // That'd mean updating how usbcore talks to HCDs. (2.7?)
  630. /*
  631. * Each QH holds a qtd list; a QH is used for everything except iso.
  632. *
  633. * For interrupt urbs, the scheduler must set the microframe scheduling
  634. * mask(s) each time the QH gets scheduled. For highspeed, that's
  635. * just one microframe in the s-mask. For split interrupt transactions
  636. * there are additional complications: c-mask, maybe FSTNs.
  637. */
  638. static struct ehci_qh *
  639. qh_make (
  640. struct ehci_hcd *ehci,
  641. struct urb *urb,
  642. gfp_t flags
  643. ) {
  644. struct ehci_qh *qh = ehci_qh_alloc (ehci, flags);
  645. u32 info1 = 0, info2 = 0;
  646. int is_input, type;
  647. int maxp = 0;
  648. struct usb_tt *tt = urb->dev->tt;
  649. struct ehci_qh_hw *hw;
  650. if (!qh)
  651. return qh;
  652. /*
  653. * init endpoint/device data for this QH
  654. */
  655. info1 |= usb_pipeendpoint (urb->pipe) << 8;
  656. info1 |= usb_pipedevice (urb->pipe) << 0;
  657. is_input = usb_pipein (urb->pipe);
  658. type = usb_pipetype (urb->pipe);
  659. maxp = usb_maxpacket (urb->dev, urb->pipe, !is_input);
  660. /* 1024 byte maxpacket is a hardware ceiling. High bandwidth
  661. * acts like up to 3KB, but is built from smaller packets.
  662. */
  663. if (max_packet(maxp) > 1024) {
  664. ehci_dbg(ehci, "bogus qh maxpacket %d\n", max_packet(maxp));
  665. goto done;
  666. }
  667. /* Compute interrupt scheduling parameters just once, and save.
  668. * - allowing for high bandwidth, how many nsec/uframe are used?
  669. * - split transactions need a second CSPLIT uframe; same question
  670. * - splits also need a schedule gap (for full/low speed I/O)
  671. * - qh has a polling interval
  672. *
  673. * For control/bulk requests, the HC or TT handles these.
  674. */
  675. if (type == PIPE_INTERRUPT) {
  676. qh->usecs = NS_TO_US(usb_calc_bus_time(USB_SPEED_HIGH,
  677. is_input, 0,
  678. hb_mult(maxp) * max_packet(maxp)));
  679. qh->start = NO_FRAME;
  680. if (urb->dev->speed == USB_SPEED_HIGH) {
  681. qh->c_usecs = 0;
  682. qh->gap_uf = 0;
  683. qh->period = urb->interval >> 3;
  684. if (qh->period == 0 && urb->interval != 1) {
  685. /* NOTE interval 2 or 4 uframes could work.
  686. * But interval 1 scheduling is simpler, and
  687. * includes high bandwidth.
  688. */
  689. dbg ("intr period %d uframes, NYET!",
  690. urb->interval);
  691. goto done;
  692. }
  693. } else {
  694. int think_time;
  695. /* gap is f(FS/LS transfer times) */
  696. qh->gap_uf = 1 + usb_calc_bus_time (urb->dev->speed,
  697. is_input, 0, maxp) / (125 * 1000);
  698. /* FIXME this just approximates SPLIT/CSPLIT times */
  699. if (is_input) { // SPLIT, gap, CSPLIT+DATA
  700. qh->c_usecs = qh->usecs + HS_USECS (0);
  701. qh->usecs = HS_USECS (1);
  702. } else { // SPLIT+DATA, gap, CSPLIT
  703. qh->usecs += HS_USECS (1);
  704. qh->c_usecs = HS_USECS (0);
  705. }
  706. think_time = tt ? tt->think_time : 0;
  707. qh->tt_usecs = NS_TO_US (think_time +
  708. usb_calc_bus_time (urb->dev->speed,
  709. is_input, 0, max_packet (maxp)));
  710. qh->period = urb->interval;
  711. }
  712. }
  713. /* support for tt scheduling, and access to toggles */
  714. qh->dev = urb->dev;
  715. /* using TT? */
  716. switch (urb->dev->speed) {
  717. case USB_SPEED_LOW:
  718. info1 |= (1 << 12); /* EPS "low" */
  719. /* FALL THROUGH */
  720. case USB_SPEED_FULL:
  721. /* EPS 0 means "full" */
  722. if (type != PIPE_INTERRUPT)
  723. info1 |= (EHCI_TUNE_RL_TT << 28);
  724. if (type == PIPE_CONTROL) {
  725. info1 |= (1 << 27); /* for TT */
  726. info1 |= 1 << 14; /* toggle from qtd */
  727. }
  728. info1 |= maxp << 16;
  729. info2 |= (EHCI_TUNE_MULT_TT << 30);
  730. /* Some Freescale processors have an erratum in which the
  731. * port number in the queue head was 0..N-1 instead of 1..N.
  732. */
  733. if (ehci_has_fsl_portno_bug(ehci))
  734. info2 |= (urb->dev->ttport-1) << 23;
  735. else
  736. info2 |= urb->dev->ttport << 23;
  737. /* set the address of the TT; for TDI's integrated
  738. * root hub tt, leave it zeroed.
  739. */
  740. if (tt && tt->hub != ehci_to_hcd(ehci)->self.root_hub)
  741. info2 |= tt->hub->devnum << 16;
  742. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets c-mask } */
  743. break;
  744. case USB_SPEED_HIGH: /* no TT involved */
  745. info1 |= (2 << 12); /* EPS "high" */
  746. if (type == PIPE_CONTROL) {
  747. info1 |= (EHCI_TUNE_RL_HS << 28);
  748. info1 |= 64 << 16; /* usb2 fixed maxpacket */
  749. info1 |= 1 << 14; /* toggle from qtd */
  750. info2 |= (EHCI_TUNE_MULT_HS << 30);
  751. } else if (type == PIPE_BULK) {
  752. info1 |= (EHCI_TUNE_RL_HS << 28);
  753. /* The USB spec says that high speed bulk endpoints
  754. * always use 512 byte maxpacket. But some device
  755. * vendors decided to ignore that, and MSFT is happy
  756. * to help them do so. So now people expect to use
  757. * such nonconformant devices with Linux too; sigh.
  758. */
  759. info1 |= max_packet(maxp) << 16;
  760. info2 |= (EHCI_TUNE_MULT_HS << 30);
  761. } else { /* PIPE_INTERRUPT */
  762. info1 |= max_packet (maxp) << 16;
  763. info2 |= hb_mult (maxp) << 30;
  764. }
  765. break;
  766. default:
  767. dbg ("bogus dev %p speed %d", urb->dev, urb->dev->speed);
  768. done:
  769. qh_put (qh);
  770. return NULL;
  771. }
  772. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets s-mask } */
  773. /* init as live, toggle clear, advance to dummy */
  774. qh->qh_state = QH_STATE_IDLE;
  775. hw = qh->hw;
  776. hw->hw_info1 = cpu_to_hc32(ehci, info1);
  777. hw->hw_info2 = cpu_to_hc32(ehci, info2);
  778. usb_settoggle (urb->dev, usb_pipeendpoint (urb->pipe), !is_input, 1);
  779. qh_refresh (ehci, qh);
  780. return qh;
  781. }
  782. /*-------------------------------------------------------------------------*/
  783. /* move qh (and its qtds) onto async queue; maybe enable queue. */
  784. static void qh_link_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  785. {
  786. __hc32 dma = QH_NEXT(ehci, qh->qh_dma);
  787. struct ehci_qh *head;
  788. /* Don't link a QH if there's a Clear-TT-Buffer pending */
  789. if (unlikely(qh->clearing_tt))
  790. return;
  791. /* (re)start the async schedule? */
  792. head = ehci->async;
  793. timer_action_done (ehci, TIMER_ASYNC_OFF);
  794. if (!head->qh_next.qh) {
  795. u32 cmd = ehci_readl(ehci, &ehci->regs->command);
  796. if (!(cmd & CMD_ASE)) {
  797. /* in case a clear of CMD_ASE didn't take yet */
  798. (void)handshake(ehci, &ehci->regs->status,
  799. STS_ASS, 0, 150);
  800. cmd |= CMD_ASE | CMD_RUN;
  801. ehci_writel(ehci, cmd, &ehci->regs->command);
  802. ehci_to_hcd(ehci)->state = HC_STATE_RUNNING;
  803. /* posted write need not be known to HC yet ... */
  804. }
  805. }
  806. /* clear halt and/or toggle; and maybe recover from silicon quirk */
  807. if (qh->qh_state == QH_STATE_IDLE)
  808. qh_refresh (ehci, qh);
  809. /* splice right after start */
  810. qh->qh_next = head->qh_next;
  811. qh->hw->hw_next = head->hw->hw_next;
  812. wmb ();
  813. head->qh_next.qh = qh;
  814. head->hw->hw_next = dma;
  815. qh_get(qh);
  816. qh->xacterrs = 0;
  817. qh->qh_state = QH_STATE_LINKED;
  818. /* qtd completions reported later by interrupt */
  819. }
  820. /*-------------------------------------------------------------------------*/
  821. /*
  822. * For control/bulk/interrupt, return QH with these TDs appended.
  823. * Allocates and initializes the QH if necessary.
  824. * Returns null if it can't allocate a QH it needs to.
  825. * If the QH has TDs (urbs) already, that's great.
  826. */
  827. static struct ehci_qh *qh_append_tds (
  828. struct ehci_hcd *ehci,
  829. struct urb *urb,
  830. struct list_head *qtd_list,
  831. int epnum,
  832. void **ptr
  833. )
  834. {
  835. struct ehci_qh *qh = NULL;
  836. __hc32 qh_addr_mask = cpu_to_hc32(ehci, 0x7f);
  837. qh = (struct ehci_qh *) *ptr;
  838. if (unlikely (qh == NULL)) {
  839. /* can't sleep here, we have ehci->lock... */
  840. qh = qh_make (ehci, urb, GFP_ATOMIC);
  841. *ptr = qh;
  842. }
  843. if (likely (qh != NULL)) {
  844. struct ehci_qtd *qtd;
  845. if (unlikely (list_empty (qtd_list)))
  846. qtd = NULL;
  847. else
  848. qtd = list_entry (qtd_list->next, struct ehci_qtd,
  849. qtd_list);
  850. /* control qh may need patching ... */
  851. if (unlikely (epnum == 0)) {
  852. /* usb_reset_device() briefly reverts to address 0 */
  853. if (usb_pipedevice (urb->pipe) == 0)
  854. qh->hw->hw_info1 &= ~qh_addr_mask;
  855. }
  856. /* just one way to queue requests: swap with the dummy qtd.
  857. * only hc or qh_refresh() ever modify the overlay.
  858. */
  859. if (likely (qtd != NULL)) {
  860. struct ehci_qtd *dummy;
  861. dma_addr_t dma;
  862. __hc32 token;
  863. /* to avoid racing the HC, use the dummy td instead of
  864. * the first td of our list (becomes new dummy). both
  865. * tds stay deactivated until we're done, when the
  866. * HC is allowed to fetch the old dummy (4.10.2).
  867. */
  868. token = qtd->hw_token;
  869. qtd->hw_token = HALT_BIT(ehci);
  870. wmb ();
  871. dummy = qh->dummy;
  872. dma = dummy->qtd_dma;
  873. *dummy = *qtd;
  874. dummy->qtd_dma = dma;
  875. list_del (&qtd->qtd_list);
  876. list_add (&dummy->qtd_list, qtd_list);
  877. list_splice_tail(qtd_list, &qh->qtd_list);
  878. ehci_qtd_init(ehci, qtd, qtd->qtd_dma);
  879. qh->dummy = qtd;
  880. /* hc must see the new dummy at list end */
  881. dma = qtd->qtd_dma;
  882. qtd = list_entry (qh->qtd_list.prev,
  883. struct ehci_qtd, qtd_list);
  884. qtd->hw_next = QTD_NEXT(ehci, dma);
  885. /* let the hc process these next qtds */
  886. wmb ();
  887. dummy->hw_token = token;
  888. urb->hcpriv = qh_get (qh);
  889. }
  890. }
  891. return qh;
  892. }
  893. /*-------------------------------------------------------------------------*/
  894. static int
  895. submit_async (
  896. struct ehci_hcd *ehci,
  897. struct urb *urb,
  898. struct list_head *qtd_list,
  899. gfp_t mem_flags
  900. ) {
  901. struct ehci_qtd *qtd;
  902. int epnum;
  903. unsigned long flags;
  904. struct ehci_qh *qh = NULL;
  905. int rc;
  906. qtd = list_entry (qtd_list->next, struct ehci_qtd, qtd_list);
  907. epnum = urb->ep->desc.bEndpointAddress;
  908. #ifdef EHCI_URB_TRACE
  909. ehci_dbg (ehci,
  910. "%s %s urb %p ep%d%s len %d, qtd %p [qh %p]\n",
  911. __func__, urb->dev->devpath, urb,
  912. epnum & 0x0f, (epnum & USB_DIR_IN) ? "in" : "out",
  913. urb->transfer_buffer_length,
  914. qtd, urb->ep->hcpriv);
  915. #endif
  916. spin_lock_irqsave (&ehci->lock, flags);
  917. if (unlikely(!test_bit(HCD_FLAG_HW_ACCESSIBLE,
  918. &ehci_to_hcd(ehci)->flags))) {
  919. rc = -ESHUTDOWN;
  920. goto done;
  921. }
  922. rc = usb_hcd_link_urb_to_ep(ehci_to_hcd(ehci), urb);
  923. if (unlikely(rc))
  924. goto done;
  925. qh = qh_append_tds(ehci, urb, qtd_list, epnum, &urb->ep->hcpriv);
  926. if (unlikely(qh == NULL)) {
  927. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  928. rc = -ENOMEM;
  929. goto done;
  930. }
  931. /* Control/bulk operations through TTs don't need scheduling,
  932. * the HC and TT handle it when the TT has a buffer ready.
  933. */
  934. if (likely (qh->qh_state == QH_STATE_IDLE))
  935. qh_link_async(ehci, qh);
  936. done:
  937. spin_unlock_irqrestore (&ehci->lock, flags);
  938. if (unlikely (qh == NULL))
  939. qtd_list_free (ehci, urb, qtd_list);
  940. return rc;
  941. }
  942. /*-------------------------------------------------------------------------*/
  943. /* the async qh for the qtds being reclaimed are now unlinked from the HC */
  944. static void end_unlink_async (struct ehci_hcd *ehci)
  945. {
  946. struct ehci_qh *qh = ehci->reclaim;
  947. struct ehci_qh *next;
  948. iaa_watchdog_done(ehci);
  949. // qh->hw_next = cpu_to_hc32(qh->qh_dma);
  950. qh->qh_state = QH_STATE_IDLE;
  951. qh->qh_next.qh = NULL;
  952. qh_put (qh); // refcount from reclaim
  953. /* other unlink(s) may be pending (in QH_STATE_UNLINK_WAIT) */
  954. next = qh->reclaim;
  955. ehci->reclaim = next;
  956. qh->reclaim = NULL;
  957. qh_completions (ehci, qh);
  958. if (!list_empty (&qh->qtd_list)
  959. && HC_IS_RUNNING (ehci_to_hcd(ehci)->state))
  960. qh_link_async (ehci, qh);
  961. else {
  962. /* it's not free to turn the async schedule on/off; leave it
  963. * active but idle for a while once it empties.
  964. */
  965. if (HC_IS_RUNNING (ehci_to_hcd(ehci)->state)
  966. && ehci->async->qh_next.qh == NULL)
  967. timer_action (ehci, TIMER_ASYNC_OFF);
  968. }
  969. qh_put(qh); /* refcount from async list */
  970. if (next) {
  971. ehci->reclaim = NULL;
  972. start_unlink_async (ehci, next);
  973. }
  974. }
  975. /* makes sure the async qh will become idle */
  976. /* caller must own ehci->lock */
  977. static void start_unlink_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  978. {
  979. int cmd = ehci_readl(ehci, &ehci->regs->command);
  980. struct ehci_qh *prev;
  981. #ifdef DEBUG
  982. assert_spin_locked(&ehci->lock);
  983. if (ehci->reclaim
  984. || (qh->qh_state != QH_STATE_LINKED
  985. && qh->qh_state != QH_STATE_UNLINK_WAIT)
  986. )
  987. BUG ();
  988. #endif
  989. /* stop async schedule right now? */
  990. if (unlikely (qh == ehci->async)) {
  991. /* can't get here without STS_ASS set */
  992. if (ehci_to_hcd(ehci)->state != HC_STATE_HALT
  993. && !ehci->reclaim) {
  994. /* ... and CMD_IAAD clear */
  995. ehci_writel(ehci, cmd & ~CMD_ASE,
  996. &ehci->regs->command);
  997. wmb ();
  998. // handshake later, if we need to
  999. timer_action_done (ehci, TIMER_ASYNC_OFF);
  1000. }
  1001. return;
  1002. }
  1003. qh->qh_state = QH_STATE_UNLINK;
  1004. ehci->reclaim = qh = qh_get (qh);
  1005. prev = ehci->async;
  1006. while (prev->qh_next.qh != qh)
  1007. prev = prev->qh_next.qh;
  1008. prev->hw->hw_next = qh->hw->hw_next;
  1009. prev->qh_next = qh->qh_next;
  1010. wmb ();
  1011. /* If the controller isn't running, we don't have to wait for it */
  1012. if (unlikely(!HC_IS_RUNNING(ehci_to_hcd(ehci)->state))) {
  1013. /* if (unlikely (qh->reclaim != 0))
  1014. * this will recurse, probably not much
  1015. */
  1016. end_unlink_async (ehci);
  1017. return;
  1018. }
  1019. cmd |= CMD_IAAD;
  1020. ehci_writel(ehci, cmd, &ehci->regs->command);
  1021. (void)ehci_readl(ehci, &ehci->regs->command);
  1022. iaa_watchdog_start(ehci);
  1023. }
  1024. /*-------------------------------------------------------------------------*/
  1025. static void scan_async (struct ehci_hcd *ehci)
  1026. {
  1027. struct ehci_qh *qh;
  1028. enum ehci_timer_action action = TIMER_IO_WATCHDOG;
  1029. ehci->stamp = ehci_readl(ehci, &ehci->regs->frame_index);
  1030. timer_action_done (ehci, TIMER_ASYNC_SHRINK);
  1031. rescan:
  1032. qh = ehci->async->qh_next.qh;
  1033. if (likely (qh != NULL)) {
  1034. do {
  1035. /* clean any finished work for this qh */
  1036. if (!list_empty (&qh->qtd_list)
  1037. && qh->stamp != ehci->stamp) {
  1038. int temp;
  1039. /* unlinks could happen here; completion
  1040. * reporting drops the lock. rescan using
  1041. * the latest schedule, but don't rescan
  1042. * qhs we already finished (no looping).
  1043. */
  1044. qh = qh_get (qh);
  1045. qh->stamp = ehci->stamp;
  1046. temp = qh_completions (ehci, qh);
  1047. qh_put (qh);
  1048. if (temp != 0) {
  1049. goto rescan;
  1050. }
  1051. }
  1052. /* unlink idle entries, reducing DMA usage as well
  1053. * as HCD schedule-scanning costs. delay for any qh
  1054. * we just scanned, there's a not-unusual case that it
  1055. * doesn't stay idle for long.
  1056. * (plus, avoids some kind of re-activation race.)
  1057. */
  1058. if (list_empty(&qh->qtd_list)
  1059. && qh->qh_state == QH_STATE_LINKED) {
  1060. if (!ehci->reclaim
  1061. && ((ehci->stamp - qh->stamp) & 0x1fff)
  1062. >= (EHCI_SHRINK_FRAMES * 8))
  1063. start_unlink_async(ehci, qh);
  1064. else
  1065. action = TIMER_ASYNC_SHRINK;
  1066. }
  1067. qh = qh->qh_next.qh;
  1068. } while (qh);
  1069. }
  1070. if (action == TIMER_ASYNC_SHRINK)
  1071. timer_action (ehci, TIMER_ASYNC_SHRINK);
  1072. }