ehci-q.c 38 KB

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