ehci-q.c 35 KB

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