ehci-q.c 37 KB

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