ehci-q.c 42 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526
  1. // SPDX-License-Identifier: GPL-2.0+
  2. /*
  3. * Copyright (C) 2001-2004 by David Brownell
  4. */
  5. /* this file is part of ehci-hcd.c */
  6. /*-------------------------------------------------------------------------*/
  7. /*
  8. * EHCI hardware queue manipulation ... the core. QH/QTD manipulation.
  9. *
  10. * Control, bulk, and interrupt traffic all use "qh" lists. They list "qtd"
  11. * entries describing USB transactions, max 16-20kB/entry (with 4kB-aligned
  12. * buffers needed for the larger number). We use one QH per endpoint, queue
  13. * multiple urbs (all three types) per endpoint. URBs may need several qtds.
  14. *
  15. * ISO traffic uses "ISO TD" (itd, and sitd) records, and (along with
  16. * interrupts) needs careful scheduling. Performance improvements can be
  17. * an ongoing challenge. That's in "ehci-sched.c".
  18. *
  19. * USB 1.1 devices are handled (a) by "companion" OHCI or UHCI root hubs,
  20. * or otherwise through transaction translators (TTs) in USB 2.0 hubs using
  21. * (b) special fields in qh entries or (c) split iso entries. TTs will
  22. * buffer low/full speed data so the host collects it at high speed.
  23. */
  24. /*-------------------------------------------------------------------------*/
  25. /* fill a qtd, returning how much of the buffer we were able to queue up */
  26. static unsigned int
  27. qtd_fill(struct ehci_hcd *ehci, struct ehci_qtd *qtd, dma_addr_t buf,
  28. size_t len, int token, int maxpacket)
  29. {
  30. unsigned int count;
  31. u64 addr = buf;
  32. int i;
  33. /* one buffer entry per 4K ... first might be short or unaligned */
  34. qtd->hw_buf[0] = cpu_to_hc32(ehci, (u32)addr);
  35. qtd->hw_buf_hi[0] = cpu_to_hc32(ehci, (u32)(addr >> 32));
  36. count = 0x1000 - (buf & 0x0fff); /* rest of that page */
  37. if (likely (len < count)) /* ... iff needed */
  38. count = len;
  39. else {
  40. buf += 0x1000;
  41. buf &= ~0x0fff;
  42. /* per-qtd limit: from 16K to 20K (best alignment) */
  43. for (i = 1; count < len && i < 5; i++) {
  44. addr = buf;
  45. qtd->hw_buf[i] = cpu_to_hc32(ehci, (u32)addr);
  46. qtd->hw_buf_hi[i] = cpu_to_hc32(ehci,
  47. (u32)(addr >> 32));
  48. buf += 0x1000;
  49. if ((count + 0x1000) < len)
  50. count += 0x1000;
  51. else
  52. count = len;
  53. }
  54. /* short packets may only terminate transfers */
  55. if (count != len)
  56. count -= (count % maxpacket);
  57. }
  58. qtd->hw_token = cpu_to_hc32(ehci, (count << 16) | token);
  59. qtd->length = count;
  60. return count;
  61. }
  62. /*-------------------------------------------------------------------------*/
  63. static inline void
  64. qh_update (struct ehci_hcd *ehci, struct ehci_qh *qh, struct ehci_qtd *qtd)
  65. {
  66. struct ehci_qh_hw *hw = qh->hw;
  67. /* writes to an active overlay are unsafe */
  68. WARN_ON(qh->qh_state != QH_STATE_IDLE);
  69. hw->hw_qtd_next = QTD_NEXT(ehci, qtd->qtd_dma);
  70. hw->hw_alt_next = EHCI_LIST_END(ehci);
  71. /* Except for control endpoints, we make hardware maintain data
  72. * toggle (like OHCI) ... here (re)initialize the toggle in the QH,
  73. * and set the pseudo-toggle in udev. Only usb_clear_halt() will
  74. * ever clear it.
  75. */
  76. if (!(hw->hw_info1 & cpu_to_hc32(ehci, QH_TOGGLE_CTL))) {
  77. unsigned is_out, epnum;
  78. is_out = qh->is_out;
  79. epnum = (hc32_to_cpup(ehci, &hw->hw_info1) >> 8) & 0x0f;
  80. if (unlikely(!usb_gettoggle(qh->ps.udev, epnum, is_out))) {
  81. hw->hw_token &= ~cpu_to_hc32(ehci, QTD_TOGGLE);
  82. usb_settoggle(qh->ps.udev, epnum, is_out, 1);
  83. }
  84. }
  85. hw->hw_token &= cpu_to_hc32(ehci, QTD_TOGGLE | QTD_STS_PING);
  86. }
  87. /* if it weren't for a common silicon quirk (writing the dummy into the qh
  88. * overlay, so qh->hw_token wrongly becomes inactive/halted), only fault
  89. * recovery (including urb dequeue) would need software changes to a QH...
  90. */
  91. static void
  92. qh_refresh (struct ehci_hcd *ehci, struct ehci_qh *qh)
  93. {
  94. struct ehci_qtd *qtd;
  95. qtd = list_entry(qh->qtd_list.next, struct ehci_qtd, qtd_list);
  96. /*
  97. * first qtd may already be partially processed.
  98. * If we come here during unlink, the QH overlay region
  99. * might have reference to the just unlinked qtd. The
  100. * qtd is updated in qh_completions(). Update the QH
  101. * overlay here.
  102. */
  103. if (qh->hw->hw_token & ACTIVE_BIT(ehci)) {
  104. qh->hw->hw_qtd_next = qtd->hw_next;
  105. if (qh->should_be_inactive)
  106. ehci_warn(ehci, "qh %p should be inactive!\n", qh);
  107. } else {
  108. qh_update(ehci, qh, qtd);
  109. }
  110. qh->should_be_inactive = 0;
  111. }
  112. /*-------------------------------------------------------------------------*/
  113. static void qh_link_async(struct ehci_hcd *ehci, struct ehci_qh *qh);
  114. static void ehci_clear_tt_buffer_complete(struct usb_hcd *hcd,
  115. struct usb_host_endpoint *ep)
  116. {
  117. struct ehci_hcd *ehci = hcd_to_ehci(hcd);
  118. struct ehci_qh *qh = ep->hcpriv;
  119. unsigned long flags;
  120. spin_lock_irqsave(&ehci->lock, flags);
  121. qh->clearing_tt = 0;
  122. if (qh->qh_state == QH_STATE_IDLE && !list_empty(&qh->qtd_list)
  123. && ehci->rh_state == EHCI_RH_RUNNING)
  124. qh_link_async(ehci, qh);
  125. spin_unlock_irqrestore(&ehci->lock, flags);
  126. }
  127. static void ehci_clear_tt_buffer(struct ehci_hcd *ehci, struct ehci_qh *qh,
  128. struct urb *urb, u32 token)
  129. {
  130. /* If an async split transaction gets an error or is unlinked,
  131. * the TT buffer may be left in an indeterminate state. We
  132. * have to clear the TT buffer.
  133. *
  134. * Note: this routine is never called for Isochronous transfers.
  135. */
  136. if (urb->dev->tt && !usb_pipeint(urb->pipe) && !qh->clearing_tt) {
  137. #ifdef CONFIG_DYNAMIC_DEBUG
  138. struct usb_device *tt = urb->dev->tt->hub;
  139. dev_dbg(&tt->dev,
  140. "clear tt buffer port %d, a%d ep%d t%08x\n",
  141. urb->dev->ttport, urb->dev->devnum,
  142. usb_pipeendpoint(urb->pipe), token);
  143. #endif /* CONFIG_DYNAMIC_DEBUG */
  144. if (!ehci_is_TDI(ehci)
  145. || urb->dev->tt->hub !=
  146. ehci_to_hcd(ehci)->self.root_hub) {
  147. if (usb_hub_clear_tt_buffer(urb) == 0)
  148. qh->clearing_tt = 1;
  149. } else {
  150. /* REVISIT ARC-derived cores don't clear the root
  151. * hub TT buffer in this way...
  152. */
  153. }
  154. }
  155. }
  156. static int qtd_copy_status (
  157. struct ehci_hcd *ehci,
  158. struct urb *urb,
  159. size_t length,
  160. u32 token
  161. )
  162. {
  163. int status = -EINPROGRESS;
  164. /* count IN/OUT bytes, not SETUP (even short packets) */
  165. if (likely(QTD_PID(token) != PID_CODE_SETUP))
  166. urb->actual_length += length - QTD_LENGTH (token);
  167. /* don't modify error codes */
  168. if (unlikely(urb->unlinked))
  169. return status;
  170. /* force cleanup after short read; not always an error */
  171. if (unlikely (IS_SHORT_READ (token)))
  172. status = -EREMOTEIO;
  173. /* serious "can't proceed" faults reported by the hardware */
  174. if (token & QTD_STS_HALT) {
  175. if (token & QTD_STS_BABBLE) {
  176. /* FIXME "must" disable babbling device's port too */
  177. status = -EOVERFLOW;
  178. /*
  179. * When MMF is active and PID Code is IN, queue is halted.
  180. * EHCI Specification, Table 4-13.
  181. */
  182. } else if ((token & QTD_STS_MMF) &&
  183. (QTD_PID(token) == PID_CODE_IN)) {
  184. status = -EPROTO;
  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) == PID_CODE_IN) /* 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. }
  210. return status;
  211. }
  212. static void
  213. ehci_urb_done(struct ehci_hcd *ehci, struct urb *urb, int status)
  214. {
  215. if (usb_pipetype(urb->pipe) == PIPE_INTERRUPT) {
  216. /* ... update hc-wide periodic stats */
  217. ehci_to_hcd(ehci)->self.bandwidth_int_reqs--;
  218. }
  219. if (unlikely(urb->unlinked)) {
  220. INCR(ehci->stats.unlink);
  221. } else {
  222. /* report non-error and short read status as zero */
  223. if (status == -EINPROGRESS || status == -EREMOTEIO)
  224. status = 0;
  225. INCR(ehci->stats.complete);
  226. }
  227. #ifdef EHCI_URB_TRACE
  228. ehci_dbg (ehci,
  229. "%s %s urb %p ep%d%s status %d len %d/%d\n",
  230. __func__, urb->dev->devpath, urb,
  231. usb_pipeendpoint (urb->pipe),
  232. usb_pipein (urb->pipe) ? "in" : "out",
  233. status,
  234. urb->actual_length, urb->transfer_buffer_length);
  235. #endif
  236. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  237. usb_hcd_giveback_urb(ehci_to_hcd(ehci), urb, status);
  238. }
  239. static int qh_schedule (struct ehci_hcd *ehci, struct ehci_qh *qh);
  240. /*
  241. * Process and free completed qtds for a qh, returning URBs to drivers.
  242. * Chases up to qh->hw_current. Returns nonzero if the caller should
  243. * unlink qh.
  244. */
  245. static unsigned
  246. qh_completions (struct ehci_hcd *ehci, struct ehci_qh *qh)
  247. {
  248. struct ehci_qtd *last, *end = qh->dummy;
  249. struct list_head *entry, *tmp;
  250. int last_status;
  251. int stopped;
  252. u8 state;
  253. struct ehci_qh_hw *hw = qh->hw;
  254. /* completions (or tasks on other cpus) must never clobber HALT
  255. * till we've gone through and cleaned everything up, even when
  256. * they add urbs to this qh's queue or mark them for unlinking.
  257. *
  258. * NOTE: unlinking expects to be done in queue order.
  259. *
  260. * It's a bug for qh->qh_state to be anything other than
  261. * QH_STATE_IDLE, unless our caller is scan_async() or
  262. * scan_intr().
  263. */
  264. state = qh->qh_state;
  265. qh->qh_state = QH_STATE_COMPLETING;
  266. stopped = (state == QH_STATE_IDLE);
  267. rescan:
  268. last = NULL;
  269. last_status = -EINPROGRESS;
  270. qh->dequeue_during_giveback = 0;
  271. /* remove de-activated QTDs from front of queue.
  272. * after faults (including short reads), cleanup this urb
  273. * then let the queue advance.
  274. * if queue is stopped, handles unlinks.
  275. */
  276. list_for_each_safe (entry, tmp, &qh->qtd_list) {
  277. struct ehci_qtd *qtd;
  278. struct urb *urb;
  279. u32 token = 0;
  280. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  281. urb = qtd->urb;
  282. /* clean up any state from previous QTD ...*/
  283. if (last) {
  284. if (likely (last->urb != urb)) {
  285. ehci_urb_done(ehci, last->urb, last_status);
  286. last_status = -EINPROGRESS;
  287. }
  288. ehci_qtd_free (ehci, last);
  289. last = NULL;
  290. }
  291. /* ignore urbs submitted during completions we reported */
  292. if (qtd == end)
  293. break;
  294. /* hardware copies qtd out of qh overlay */
  295. rmb ();
  296. token = hc32_to_cpu(ehci, qtd->hw_token);
  297. /* always clean up qtds the hc de-activated */
  298. retry_xacterr:
  299. if ((token & QTD_STS_ACTIVE) == 0) {
  300. /* Report Data Buffer Error: non-fatal but useful */
  301. if (token & QTD_STS_DBE)
  302. ehci_dbg(ehci,
  303. "detected DataBufferErr for urb %p ep%d%s len %d, qtd %p [qh %p]\n",
  304. urb,
  305. usb_endpoint_num(&urb->ep->desc),
  306. usb_endpoint_dir_in(&urb->ep->desc) ? "in" : "out",
  307. urb->transfer_buffer_length,
  308. qtd,
  309. qh);
  310. /* on STALL, error, and short reads this urb must
  311. * complete and all its qtds must be recycled.
  312. */
  313. if ((token & QTD_STS_HALT) != 0) {
  314. /* retry transaction errors until we
  315. * reach the software xacterr limit
  316. */
  317. if ((token & QTD_STS_XACT) &&
  318. QTD_CERR(token) == 0 &&
  319. ++qh->xacterrs < QH_XACTERR_MAX &&
  320. !urb->unlinked) {
  321. ehci_dbg(ehci,
  322. "detected XactErr len %zu/%zu retry %d\n",
  323. qtd->length - QTD_LENGTH(token), qtd->length, qh->xacterrs);
  324. /* reset the token in the qtd and the
  325. * qh overlay (which still contains
  326. * the qtd) so that we pick up from
  327. * where we left off
  328. */
  329. token &= ~QTD_STS_HALT;
  330. token |= QTD_STS_ACTIVE |
  331. (EHCI_TUNE_CERR << 10);
  332. qtd->hw_token = cpu_to_hc32(ehci,
  333. token);
  334. wmb();
  335. hw->hw_token = cpu_to_hc32(ehci,
  336. token);
  337. goto retry_xacterr;
  338. }
  339. stopped = 1;
  340. qh->unlink_reason |= QH_UNLINK_HALTED;
  341. /* magic dummy for some short reads; qh won't advance.
  342. * that silicon quirk can kick in with this dummy too.
  343. *
  344. * other short reads won't stop the queue, including
  345. * control transfers (status stage handles that) or
  346. * most other single-qtd reads ... the queue stops if
  347. * URB_SHORT_NOT_OK was set so the driver submitting
  348. * the urbs could clean it up.
  349. */
  350. } else if (IS_SHORT_READ (token)
  351. && !(qtd->hw_alt_next
  352. & EHCI_LIST_END(ehci))) {
  353. stopped = 1;
  354. qh->unlink_reason |= QH_UNLINK_SHORT_READ;
  355. }
  356. /* stop scanning when we reach qtds the hc is using */
  357. } else if (likely (!stopped
  358. && ehci->rh_state >= EHCI_RH_RUNNING)) {
  359. break;
  360. /* scan the whole queue for unlinks whenever it stops */
  361. } else {
  362. stopped = 1;
  363. /* cancel everything if we halt, suspend, etc */
  364. if (ehci->rh_state < EHCI_RH_RUNNING) {
  365. last_status = -ESHUTDOWN;
  366. qh->unlink_reason |= QH_UNLINK_SHUTDOWN;
  367. }
  368. /* this qtd is active; skip it unless a previous qtd
  369. * for its urb faulted, or its urb was canceled.
  370. */
  371. else if (last_status == -EINPROGRESS && !urb->unlinked)
  372. continue;
  373. /*
  374. * If this was the active qtd when the qh was unlinked
  375. * and the overlay's token is active, then the overlay
  376. * hasn't been written back to the qtd yet so use its
  377. * token instead of the qtd's. After the qtd is
  378. * processed and removed, the overlay won't be valid
  379. * any more.
  380. */
  381. if (state == QH_STATE_IDLE &&
  382. qh->qtd_list.next == &qtd->qtd_list &&
  383. (hw->hw_token & ACTIVE_BIT(ehci))) {
  384. token = hc32_to_cpu(ehci, hw->hw_token);
  385. hw->hw_token &= ~ACTIVE_BIT(ehci);
  386. qh->should_be_inactive = 1;
  387. /* An unlink may leave an incomplete
  388. * async transaction in the TT buffer.
  389. * We have to clear it.
  390. */
  391. ehci_clear_tt_buffer(ehci, qh, urb, token);
  392. }
  393. }
  394. /* unless we already know the urb's status, collect qtd status
  395. * and update count of bytes transferred. in common short read
  396. * cases with only one data qtd (including control transfers),
  397. * queue processing won't halt. but with two or more qtds (for
  398. * example, with a 32 KB transfer), when the first qtd gets a
  399. * short read the second must be removed by hand.
  400. */
  401. if (last_status == -EINPROGRESS) {
  402. last_status = qtd_copy_status(ehci, urb,
  403. qtd->length, token);
  404. if (last_status == -EREMOTEIO
  405. && (qtd->hw_alt_next
  406. & EHCI_LIST_END(ehci)))
  407. last_status = -EINPROGRESS;
  408. /* As part of low/full-speed endpoint-halt processing
  409. * we must clear the TT buffer (11.17.5).
  410. */
  411. if (unlikely(last_status != -EINPROGRESS &&
  412. last_status != -EREMOTEIO)) {
  413. /* The TT's in some hubs malfunction when they
  414. * receive this request following a STALL (they
  415. * stop sending isochronous packets). Since a
  416. * STALL can't leave the TT buffer in a busy
  417. * state (if you believe Figures 11-48 - 11-51
  418. * in the USB 2.0 spec), we won't clear the TT
  419. * buffer in this case. Strictly speaking this
  420. * is a violation of the spec.
  421. */
  422. if (last_status != -EPIPE)
  423. ehci_clear_tt_buffer(ehci, qh, urb,
  424. token);
  425. }
  426. }
  427. /* if we're removing something not at the queue head,
  428. * patch the hardware queue pointer.
  429. */
  430. if (stopped && qtd->qtd_list.prev != &qh->qtd_list) {
  431. last = list_entry (qtd->qtd_list.prev,
  432. struct ehci_qtd, qtd_list);
  433. last->hw_next = qtd->hw_next;
  434. }
  435. /* remove qtd; it's recycled after possible urb completion */
  436. list_del (&qtd->qtd_list);
  437. last = qtd;
  438. /* reinit the xacterr counter for the next qtd */
  439. qh->xacterrs = 0;
  440. }
  441. /* last urb's completion might still need calling */
  442. if (likely (last != NULL)) {
  443. ehci_urb_done(ehci, last->urb, last_status);
  444. ehci_qtd_free (ehci, last);
  445. }
  446. /* Do we need to rescan for URBs dequeued during a giveback? */
  447. if (unlikely(qh->dequeue_during_giveback)) {
  448. /* If the QH is already unlinked, do the rescan now. */
  449. if (state == QH_STATE_IDLE)
  450. goto rescan;
  451. /* Otherwise the caller must unlink the QH. */
  452. }
  453. /* restore original state; caller must unlink or relink */
  454. qh->qh_state = state;
  455. /* be sure the hardware's done with the qh before refreshing
  456. * it after fault cleanup, or recovering from silicon wrongly
  457. * overlaying the dummy qtd (which reduces DMA chatter).
  458. *
  459. * We won't refresh a QH that's linked (after the HC
  460. * stopped the queue). That avoids a race:
  461. * - HC reads first part of QH;
  462. * - CPU updates that first part and the token;
  463. * - HC reads rest of that QH, including token
  464. * Result: HC gets an inconsistent image, and then
  465. * DMAs to/from the wrong memory (corrupting it).
  466. *
  467. * That should be rare for interrupt transfers,
  468. * except maybe high bandwidth ...
  469. */
  470. if (stopped != 0 || hw->hw_qtd_next == EHCI_LIST_END(ehci))
  471. qh->unlink_reason |= QH_UNLINK_DUMMY_OVERLAY;
  472. /* Let the caller know if the QH needs to be unlinked. */
  473. return qh->unlink_reason;
  474. }
  475. /*-------------------------------------------------------------------------*/
  476. /*
  477. * reverse of qh_urb_transaction: free a list of TDs.
  478. * used for cleanup after errors, before HC sees an URB's TDs.
  479. */
  480. static void qtd_list_free (
  481. struct ehci_hcd *ehci,
  482. struct urb *urb,
  483. struct list_head *qtd_list
  484. ) {
  485. struct list_head *entry, *temp;
  486. list_for_each_safe (entry, temp, qtd_list) {
  487. struct ehci_qtd *qtd;
  488. qtd = list_entry (entry, struct ehci_qtd, qtd_list);
  489. list_del (&qtd->qtd_list);
  490. ehci_qtd_free (ehci, qtd);
  491. }
  492. }
  493. /*
  494. * create a list of filled qtds for this URB; won't link into qh.
  495. */
  496. static struct list_head *
  497. qh_urb_transaction (
  498. struct ehci_hcd *ehci,
  499. struct urb *urb,
  500. struct list_head *head,
  501. gfp_t flags
  502. ) {
  503. struct ehci_qtd *qtd, *qtd_prev;
  504. dma_addr_t buf;
  505. int len, this_sg_len, maxpacket;
  506. int is_input;
  507. u32 token;
  508. int i;
  509. struct scatterlist *sg;
  510. /*
  511. * URBs map to sequences of QTDs: one logical transaction
  512. */
  513. qtd = ehci_qtd_alloc (ehci, flags);
  514. if (unlikely (!qtd))
  515. return NULL;
  516. list_add_tail (&qtd->qtd_list, head);
  517. qtd->urb = urb;
  518. token = QTD_STS_ACTIVE;
  519. token |= (EHCI_TUNE_CERR << 10);
  520. /* for split transactions, SplitXState initialized to zero */
  521. len = urb->transfer_buffer_length;
  522. is_input = usb_pipein (urb->pipe);
  523. if (usb_pipecontrol (urb->pipe)) {
  524. /* SETUP pid */
  525. qtd_fill(ehci, qtd, urb->setup_dma,
  526. sizeof (struct usb_ctrlrequest),
  527. token | (PID_CODE_SETUP << 8), 8);
  528. /* ... and always at least one more pid */
  529. token ^= QTD_TOGGLE;
  530. qtd_prev = qtd;
  531. qtd = ehci_qtd_alloc (ehci, flags);
  532. if (unlikely (!qtd))
  533. goto cleanup;
  534. qtd->urb = urb;
  535. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  536. list_add_tail (&qtd->qtd_list, head);
  537. /* for zero length DATA stages, STATUS is always IN */
  538. if (len == 0)
  539. token |= (PID_CODE_IN << 8);
  540. }
  541. /*
  542. * data transfer stage: buffer setup
  543. */
  544. i = urb->num_mapped_sgs;
  545. if (len > 0 && i > 0) {
  546. sg = urb->sg;
  547. buf = sg_dma_address(sg);
  548. /* urb->transfer_buffer_length may be smaller than the
  549. * size of the scatterlist (or vice versa)
  550. */
  551. this_sg_len = min_t(int, sg_dma_len(sg), len);
  552. } else {
  553. sg = NULL;
  554. buf = urb->transfer_dma;
  555. this_sg_len = len;
  556. }
  557. if (is_input)
  558. token |= (PID_CODE_IN << 8);
  559. /* else it's already initted to "out" pid (0 << 8) */
  560. maxpacket = usb_endpoint_maxp(&urb->ep->desc);
  561. /*
  562. * buffer gets wrapped in one or more qtds;
  563. * last one may be "short" (including zero len)
  564. * and may serve as a control status ack
  565. */
  566. for (;;) {
  567. unsigned int this_qtd_len;
  568. this_qtd_len = qtd_fill(ehci, qtd, buf, this_sg_len, token,
  569. maxpacket);
  570. this_sg_len -= this_qtd_len;
  571. len -= this_qtd_len;
  572. buf += this_qtd_len;
  573. /*
  574. * short reads advance to a "magic" dummy instead of the next
  575. * qtd ... that forces the queue to stop, for manual cleanup.
  576. * (this will usually be overridden later.)
  577. */
  578. if (is_input)
  579. qtd->hw_alt_next = ehci->async->hw->hw_alt_next;
  580. /* qh makes control packets use qtd toggle; maybe switch it */
  581. if ((maxpacket & (this_qtd_len + (maxpacket - 1))) == 0)
  582. token ^= QTD_TOGGLE;
  583. if (likely(this_sg_len <= 0)) {
  584. if (--i <= 0 || len <= 0)
  585. break;
  586. sg = sg_next(sg);
  587. buf = sg_dma_address(sg);
  588. this_sg_len = min_t(int, sg_dma_len(sg), len);
  589. }
  590. qtd_prev = qtd;
  591. qtd = ehci_qtd_alloc (ehci, flags);
  592. if (unlikely (!qtd))
  593. goto cleanup;
  594. qtd->urb = urb;
  595. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  596. list_add_tail (&qtd->qtd_list, head);
  597. }
  598. /*
  599. * unless the caller requires manual cleanup after short reads,
  600. * have the alt_next mechanism keep the queue running after the
  601. * last data qtd (the only one, for control and most other cases).
  602. */
  603. if (likely ((urb->transfer_flags & URB_SHORT_NOT_OK) == 0
  604. || usb_pipecontrol (urb->pipe)))
  605. qtd->hw_alt_next = EHCI_LIST_END(ehci);
  606. /*
  607. * control requests may need a terminating data "status" ack;
  608. * other OUT ones may need a terminating short packet
  609. * (zero length).
  610. */
  611. if (likely (urb->transfer_buffer_length != 0)) {
  612. int one_more = 0;
  613. if (usb_pipecontrol (urb->pipe)) {
  614. one_more = 1;
  615. token ^= (PID_CODE_IN << 8); /* "in" <--> "out" */
  616. token |= QTD_TOGGLE; /* force DATA1 */
  617. } else if (usb_pipeout(urb->pipe)
  618. && (urb->transfer_flags & URB_ZERO_PACKET)
  619. && !(urb->transfer_buffer_length % maxpacket)) {
  620. one_more = 1;
  621. }
  622. if (one_more) {
  623. qtd_prev = qtd;
  624. qtd = ehci_qtd_alloc (ehci, flags);
  625. if (unlikely (!qtd))
  626. goto cleanup;
  627. qtd->urb = urb;
  628. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  629. list_add_tail (&qtd->qtd_list, head);
  630. /* never any data in such packets */
  631. qtd_fill(ehci, qtd, 0, 0, token, 0);
  632. }
  633. }
  634. /* by default, enable interrupt on urb completion */
  635. if (likely (!(urb->transfer_flags & URB_NO_INTERRUPT)))
  636. qtd->hw_token |= cpu_to_hc32(ehci, QTD_IOC);
  637. return head;
  638. cleanup:
  639. qtd_list_free (ehci, urb, head);
  640. return NULL;
  641. }
  642. /*-------------------------------------------------------------------------*/
  643. // Would be best to create all qh's from config descriptors,
  644. // when each interface/altsetting is established. Unlink
  645. // any previous qh and cancel its urbs first; endpoints are
  646. // implicitly reset then (data toggle too).
  647. // That'd mean updating how usbcore talks to HCDs. (2.7?)
  648. /*
  649. * Each QH holds a qtd list; a QH is used for everything except iso.
  650. *
  651. * For interrupt urbs, the scheduler must set the microframe scheduling
  652. * mask(s) each time the QH gets scheduled. For highspeed, that's
  653. * just one microframe in the s-mask. For split interrupt transactions
  654. * there are additional complications: c-mask, maybe FSTNs.
  655. */
  656. static struct ehci_qh *
  657. qh_make (
  658. struct ehci_hcd *ehci,
  659. struct urb *urb,
  660. gfp_t flags
  661. ) {
  662. struct ehci_qh *qh = ehci_qh_alloc (ehci, flags);
  663. struct usb_host_endpoint *ep;
  664. u32 info1 = 0, info2 = 0;
  665. int is_input, type;
  666. int maxp = 0;
  667. int mult;
  668. struct usb_tt *tt = urb->dev->tt;
  669. struct ehci_qh_hw *hw;
  670. if (!qh)
  671. return qh;
  672. /*
  673. * init endpoint/device data for this QH
  674. */
  675. info1 |= usb_pipeendpoint (urb->pipe) << 8;
  676. info1 |= usb_pipedevice (urb->pipe) << 0;
  677. is_input = usb_pipein (urb->pipe);
  678. type = usb_pipetype (urb->pipe);
  679. ep = usb_pipe_endpoint (urb->dev, urb->pipe);
  680. maxp = usb_endpoint_maxp (&ep->desc);
  681. mult = usb_endpoint_maxp_mult (&ep->desc);
  682. /* 1024 byte maxpacket is a hardware ceiling. High bandwidth
  683. * acts like up to 3KB, but is built from smaller packets.
  684. */
  685. if (maxp > 1024) {
  686. ehci_dbg(ehci, "bogus qh maxpacket %d\n", maxp);
  687. goto done;
  688. }
  689. /* Compute interrupt scheduling parameters just once, and save.
  690. * - allowing for high bandwidth, how many nsec/uframe are used?
  691. * - split transactions need a second CSPLIT uframe; same question
  692. * - splits also need a schedule gap (for full/low speed I/O)
  693. * - qh has a polling interval
  694. *
  695. * For control/bulk requests, the HC or TT handles these.
  696. */
  697. if (type == PIPE_INTERRUPT) {
  698. unsigned tmp;
  699. qh->ps.usecs = NS_TO_US(usb_calc_bus_time(USB_SPEED_HIGH,
  700. is_input, 0, mult * maxp));
  701. qh->ps.phase = NO_FRAME;
  702. if (urb->dev->speed == USB_SPEED_HIGH) {
  703. qh->ps.c_usecs = 0;
  704. qh->gap_uf = 0;
  705. if (urb->interval > 1 && urb->interval < 8) {
  706. /* NOTE interval 2 or 4 uframes could work.
  707. * But interval 1 scheduling is simpler, and
  708. * includes high bandwidth.
  709. */
  710. urb->interval = 1;
  711. } else if (urb->interval > ehci->periodic_size << 3) {
  712. urb->interval = ehci->periodic_size << 3;
  713. }
  714. qh->ps.period = urb->interval >> 3;
  715. /* period for bandwidth allocation */
  716. tmp = min_t(unsigned, EHCI_BANDWIDTH_SIZE,
  717. 1 << (urb->ep->desc.bInterval - 1));
  718. /* Allow urb->interval to override */
  719. qh->ps.bw_uperiod = min_t(unsigned, tmp, urb->interval);
  720. qh->ps.bw_period = qh->ps.bw_uperiod >> 3;
  721. } else {
  722. int think_time;
  723. /* gap is f(FS/LS transfer times) */
  724. qh->gap_uf = 1 + usb_calc_bus_time (urb->dev->speed,
  725. is_input, 0, maxp) / (125 * 1000);
  726. /* FIXME this just approximates SPLIT/CSPLIT times */
  727. if (is_input) { // SPLIT, gap, CSPLIT+DATA
  728. qh->ps.c_usecs = qh->ps.usecs + HS_USECS(0);
  729. qh->ps.usecs = HS_USECS(1);
  730. } else { // SPLIT+DATA, gap, CSPLIT
  731. qh->ps.usecs += HS_USECS(1);
  732. qh->ps.c_usecs = HS_USECS(0);
  733. }
  734. think_time = tt ? tt->think_time : 0;
  735. qh->ps.tt_usecs = NS_TO_US(think_time +
  736. usb_calc_bus_time (urb->dev->speed,
  737. is_input, 0, maxp));
  738. if (urb->interval > ehci->periodic_size)
  739. urb->interval = ehci->periodic_size;
  740. qh->ps.period = urb->interval;
  741. /* period for bandwidth allocation */
  742. tmp = min_t(unsigned, EHCI_BANDWIDTH_FRAMES,
  743. urb->ep->desc.bInterval);
  744. tmp = rounddown_pow_of_two(tmp);
  745. /* Allow urb->interval to override */
  746. qh->ps.bw_period = min_t(unsigned, tmp, urb->interval);
  747. qh->ps.bw_uperiod = qh->ps.bw_period << 3;
  748. }
  749. }
  750. /* support for tt scheduling, and access to toggles */
  751. qh->ps.udev = urb->dev;
  752. qh->ps.ep = urb->ep;
  753. /* using TT? */
  754. switch (urb->dev->speed) {
  755. case USB_SPEED_LOW:
  756. info1 |= QH_LOW_SPEED;
  757. fallthrough;
  758. case USB_SPEED_FULL:
  759. /* EPS 0 means "full" */
  760. if (type != PIPE_INTERRUPT)
  761. info1 |= (EHCI_TUNE_RL_TT << 28);
  762. if (type == PIPE_CONTROL) {
  763. info1 |= QH_CONTROL_EP; /* for TT */
  764. info1 |= QH_TOGGLE_CTL; /* toggle from qtd */
  765. }
  766. info1 |= maxp << 16;
  767. info2 |= (EHCI_TUNE_MULT_TT << 30);
  768. /* Some Freescale processors have an erratum in which the
  769. * port number in the queue head was 0..N-1 instead of 1..N.
  770. */
  771. if (ehci_has_fsl_portno_bug(ehci))
  772. info2 |= (urb->dev->ttport-1) << 23;
  773. else
  774. info2 |= urb->dev->ttport << 23;
  775. /* set the address of the TT; for TDI's integrated
  776. * root hub tt, leave it zeroed.
  777. */
  778. if (tt && tt->hub != ehci_to_hcd(ehci)->self.root_hub)
  779. info2 |= tt->hub->devnum << 16;
  780. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets c-mask } */
  781. break;
  782. case USB_SPEED_HIGH: /* no TT involved */
  783. info1 |= QH_HIGH_SPEED;
  784. if (type == PIPE_CONTROL) {
  785. info1 |= (EHCI_TUNE_RL_HS << 28);
  786. info1 |= 64 << 16; /* usb2 fixed maxpacket */
  787. info1 |= QH_TOGGLE_CTL; /* toggle from qtd */
  788. info2 |= (EHCI_TUNE_MULT_HS << 30);
  789. } else if (type == PIPE_BULK) {
  790. info1 |= (EHCI_TUNE_RL_HS << 28);
  791. /* The USB spec says that high speed bulk endpoints
  792. * always use 512 byte maxpacket. But some device
  793. * vendors decided to ignore that, and MSFT is happy
  794. * to help them do so. So now people expect to use
  795. * such nonconformant devices with Linux too; sigh.
  796. */
  797. info1 |= maxp << 16;
  798. info2 |= (EHCI_TUNE_MULT_HS << 30);
  799. } else { /* PIPE_INTERRUPT */
  800. info1 |= maxp << 16;
  801. info2 |= mult << 30;
  802. }
  803. break;
  804. default:
  805. ehci_dbg(ehci, "bogus dev %p speed %d\n", urb->dev,
  806. urb->dev->speed);
  807. done:
  808. qh_destroy(ehci, qh);
  809. return NULL;
  810. }
  811. /* NOTE: if (PIPE_INTERRUPT) { scheduler sets s-mask } */
  812. /* init as live, toggle clear */
  813. qh->qh_state = QH_STATE_IDLE;
  814. hw = qh->hw;
  815. hw->hw_info1 = cpu_to_hc32(ehci, info1);
  816. hw->hw_info2 = cpu_to_hc32(ehci, info2);
  817. qh->is_out = !is_input;
  818. usb_settoggle (urb->dev, usb_pipeendpoint (urb->pipe), !is_input, 1);
  819. return qh;
  820. }
  821. /*-------------------------------------------------------------------------*/
  822. static void enable_async(struct ehci_hcd *ehci)
  823. {
  824. if (ehci->async_count++)
  825. return;
  826. /* Stop waiting to turn off the async schedule */
  827. ehci->enabled_hrtimer_events &= ~BIT(EHCI_HRTIMER_DISABLE_ASYNC);
  828. /* Don't start the schedule until ASS is 0 */
  829. ehci_poll_ASS(ehci);
  830. turn_on_io_watchdog(ehci);
  831. }
  832. static void disable_async(struct ehci_hcd *ehci)
  833. {
  834. if (--ehci->async_count)
  835. return;
  836. /* The async schedule and unlink lists are supposed to be empty */
  837. WARN_ON(ehci->async->qh_next.qh || !list_empty(&ehci->async_unlink) ||
  838. !list_empty(&ehci->async_idle));
  839. /* Don't turn off the schedule until ASS is 1 */
  840. ehci_poll_ASS(ehci);
  841. }
  842. /* move qh (and its qtds) onto async queue; maybe enable queue. */
  843. static void qh_link_async (struct ehci_hcd *ehci, struct ehci_qh *qh)
  844. {
  845. __hc32 dma = QH_NEXT(ehci, qh->qh_dma);
  846. struct ehci_qh *head;
  847. /* Don't link a QH if there's a Clear-TT-Buffer pending */
  848. if (unlikely(qh->clearing_tt))
  849. return;
  850. WARN_ON(qh->qh_state != QH_STATE_IDLE);
  851. /* clear halt and/or toggle; and maybe recover from silicon quirk */
  852. qh_refresh(ehci, qh);
  853. /* splice right after start */
  854. head = ehci->async;
  855. qh->qh_next = head->qh_next;
  856. qh->hw->hw_next = head->hw->hw_next;
  857. wmb ();
  858. head->qh_next.qh = qh;
  859. head->hw->hw_next = dma;
  860. qh->qh_state = QH_STATE_LINKED;
  861. qh->xacterrs = 0;
  862. qh->unlink_reason = 0;
  863. /* qtd completions reported later by interrupt */
  864. enable_async(ehci);
  865. }
  866. /*-------------------------------------------------------------------------*/
  867. /*
  868. * For control/bulk/interrupt, return QH with these TDs appended.
  869. * Allocates and initializes the QH if necessary.
  870. * Returns null if it can't allocate a QH it needs to.
  871. * If the QH has TDs (urbs) already, that's great.
  872. */
  873. static struct ehci_qh *qh_append_tds (
  874. struct ehci_hcd *ehci,
  875. struct urb *urb,
  876. struct list_head *qtd_list,
  877. int epnum,
  878. void **ptr
  879. )
  880. {
  881. struct ehci_qh *qh = NULL;
  882. __hc32 qh_addr_mask = cpu_to_hc32(ehci, 0x7f);
  883. qh = (struct ehci_qh *) *ptr;
  884. if (unlikely (qh == NULL)) {
  885. /* can't sleep here, we have ehci->lock... */
  886. qh = qh_make (ehci, urb, GFP_ATOMIC);
  887. *ptr = qh;
  888. }
  889. if (likely (qh != NULL)) {
  890. struct ehci_qtd *qtd;
  891. if (unlikely (list_empty (qtd_list)))
  892. qtd = NULL;
  893. else
  894. qtd = list_entry (qtd_list->next, struct ehci_qtd,
  895. qtd_list);
  896. /* control qh may need patching ... */
  897. if (unlikely (epnum == 0)) {
  898. /* usb_reset_device() briefly reverts to address 0 */
  899. if (usb_pipedevice (urb->pipe) == 0)
  900. qh->hw->hw_info1 &= ~qh_addr_mask;
  901. }
  902. /* just one way to queue requests: swap with the dummy qtd.
  903. * only hc or qh_refresh() ever modify the overlay.
  904. */
  905. if (likely (qtd != NULL)) {
  906. struct ehci_qtd *dummy;
  907. dma_addr_t dma;
  908. __hc32 token;
  909. /* to avoid racing the HC, use the dummy td instead of
  910. * the first td of our list (becomes new dummy). both
  911. * tds stay deactivated until we're done, when the
  912. * HC is allowed to fetch the old dummy (4.10.2).
  913. */
  914. token = qtd->hw_token;
  915. qtd->hw_token = HALT_BIT(ehci);
  916. dummy = qh->dummy;
  917. dma = dummy->qtd_dma;
  918. *dummy = *qtd;
  919. dummy->qtd_dma = dma;
  920. list_del (&qtd->qtd_list);
  921. list_add (&dummy->qtd_list, qtd_list);
  922. list_splice_tail(qtd_list, &qh->qtd_list);
  923. ehci_qtd_init(ehci, qtd, qtd->qtd_dma);
  924. qh->dummy = qtd;
  925. /* hc must see the new dummy at list end */
  926. dma = qtd->qtd_dma;
  927. qtd = list_entry (qh->qtd_list.prev,
  928. struct ehci_qtd, qtd_list);
  929. qtd->hw_next = QTD_NEXT(ehci, dma);
  930. /* let the hc process these next qtds */
  931. wmb ();
  932. dummy->hw_token = token;
  933. urb->hcpriv = qh;
  934. }
  935. }
  936. return qh;
  937. }
  938. /*-------------------------------------------------------------------------*/
  939. static int
  940. submit_async (
  941. struct ehci_hcd *ehci,
  942. struct urb *urb,
  943. struct list_head *qtd_list,
  944. gfp_t mem_flags
  945. ) {
  946. int epnum;
  947. unsigned long flags;
  948. struct ehci_qh *qh = NULL;
  949. int rc;
  950. epnum = urb->ep->desc.bEndpointAddress;
  951. #ifdef EHCI_URB_TRACE
  952. {
  953. struct ehci_qtd *qtd;
  954. qtd = list_entry(qtd_list->next, struct ehci_qtd, qtd_list);
  955. ehci_dbg(ehci,
  956. "%s %s urb %p ep%d%s len %d, qtd %p [qh %p]\n",
  957. __func__, urb->dev->devpath, urb,
  958. epnum & 0x0f, (epnum & USB_DIR_IN) ? "in" : "out",
  959. urb->transfer_buffer_length,
  960. qtd, urb->ep->hcpriv);
  961. }
  962. #endif
  963. spin_lock_irqsave (&ehci->lock, flags);
  964. if (unlikely(!HCD_HW_ACCESSIBLE(ehci_to_hcd(ehci)))) {
  965. rc = -ESHUTDOWN;
  966. goto done;
  967. }
  968. rc = usb_hcd_link_urb_to_ep(ehci_to_hcd(ehci), urb);
  969. if (unlikely(rc))
  970. goto done;
  971. qh = qh_append_tds(ehci, urb, qtd_list, epnum, &urb->ep->hcpriv);
  972. if (unlikely(qh == NULL)) {
  973. usb_hcd_unlink_urb_from_ep(ehci_to_hcd(ehci), urb);
  974. rc = -ENOMEM;
  975. goto done;
  976. }
  977. /* Control/bulk operations through TTs don't need scheduling,
  978. * the HC and TT handle it when the TT has a buffer ready.
  979. */
  980. if (likely (qh->qh_state == QH_STATE_IDLE))
  981. qh_link_async(ehci, qh);
  982. done:
  983. spin_unlock_irqrestore (&ehci->lock, flags);
  984. if (unlikely (qh == NULL))
  985. qtd_list_free (ehci, urb, qtd_list);
  986. return rc;
  987. }
  988. /*-------------------------------------------------------------------------*/
  989. #ifdef CONFIG_USB_HCD_TEST_MODE
  990. /*
  991. * This function creates the qtds and submits them for the
  992. * SINGLE_STEP_SET_FEATURE Test.
  993. * This is done in two parts: first SETUP req for GetDesc is sent then
  994. * 15 seconds later, the IN stage for GetDesc starts to req data from dev
  995. *
  996. * is_setup : i/p argument decides which of the two stage needs to be
  997. * performed; TRUE - SETUP and FALSE - IN+STATUS
  998. * Returns 0 if success
  999. */
  1000. static int ehci_submit_single_step_set_feature(
  1001. struct usb_hcd *hcd,
  1002. struct urb *urb,
  1003. int is_setup
  1004. ) {
  1005. struct ehci_hcd *ehci = hcd_to_ehci(hcd);
  1006. struct list_head qtd_list;
  1007. struct list_head *head;
  1008. struct ehci_qtd *qtd, *qtd_prev;
  1009. dma_addr_t buf;
  1010. int len, maxpacket;
  1011. u32 token;
  1012. INIT_LIST_HEAD(&qtd_list);
  1013. head = &qtd_list;
  1014. /* URBs map to sequences of QTDs: one logical transaction */
  1015. qtd = ehci_qtd_alloc(ehci, GFP_KERNEL);
  1016. if (unlikely(!qtd))
  1017. return -1;
  1018. list_add_tail(&qtd->qtd_list, head);
  1019. qtd->urb = urb;
  1020. token = QTD_STS_ACTIVE;
  1021. token |= (EHCI_TUNE_CERR << 10);
  1022. len = urb->transfer_buffer_length;
  1023. /*
  1024. * Check if the request is to perform just the SETUP stage (getDesc)
  1025. * as in SINGLE_STEP_SET_FEATURE test, DATA stage (IN) happens
  1026. * 15 secs after the setup
  1027. */
  1028. if (is_setup) {
  1029. /* SETUP pid, and interrupt after SETUP completion */
  1030. qtd_fill(ehci, qtd, urb->setup_dma,
  1031. sizeof(struct usb_ctrlrequest),
  1032. QTD_IOC | token | (PID_CODE_SETUP << 8), 8);
  1033. submit_async(ehci, urb, &qtd_list, GFP_ATOMIC);
  1034. return 0; /*Return now; we shall come back after 15 seconds*/
  1035. }
  1036. /*
  1037. * IN: data transfer stage: buffer setup : start the IN txn phase for
  1038. * the get_Desc SETUP which was sent 15seconds back
  1039. */
  1040. token ^= QTD_TOGGLE; /*We need to start IN with DATA-1 Pid-sequence*/
  1041. buf = urb->transfer_dma;
  1042. token |= (PID_CODE_IN << 8); /*This is IN stage*/
  1043. maxpacket = usb_endpoint_maxp(&urb->ep->desc);
  1044. qtd_fill(ehci, qtd, buf, len, token, maxpacket);
  1045. /*
  1046. * Our IN phase shall always be a short read; so keep the queue running
  1047. * and let it advance to the next qtd which zero length OUT status
  1048. */
  1049. qtd->hw_alt_next = EHCI_LIST_END(ehci);
  1050. /* STATUS stage for GetDesc control request */
  1051. token ^= (PID_CODE_IN << 8); /* "in" <--> "out" */
  1052. token |= QTD_TOGGLE; /* force DATA1 */
  1053. qtd_prev = qtd;
  1054. qtd = ehci_qtd_alloc(ehci, GFP_ATOMIC);
  1055. if (unlikely(!qtd))
  1056. goto cleanup;
  1057. qtd->urb = urb;
  1058. qtd_prev->hw_next = QTD_NEXT(ehci, qtd->qtd_dma);
  1059. list_add_tail(&qtd->qtd_list, head);
  1060. /* Interrupt after STATUS completion */
  1061. qtd_fill(ehci, qtd, 0, 0, token | QTD_IOC, 0);
  1062. submit_async(ehci, urb, &qtd_list, GFP_KERNEL);
  1063. return 0;
  1064. cleanup:
  1065. qtd_list_free(ehci, urb, head);
  1066. return -1;
  1067. }
  1068. #endif /* CONFIG_USB_HCD_TEST_MODE */
  1069. /*-------------------------------------------------------------------------*/
  1070. static void single_unlink_async(struct ehci_hcd *ehci, struct ehci_qh *qh)
  1071. {
  1072. struct ehci_qh *prev;
  1073. /* Add to the end of the list of QHs waiting for the next IAAD */
  1074. qh->qh_state = QH_STATE_UNLINK_WAIT;
  1075. list_add_tail(&qh->unlink_node, &ehci->async_unlink);
  1076. /* Unlink it from the schedule */
  1077. prev = ehci->async;
  1078. while (prev->qh_next.qh != qh)
  1079. prev = prev->qh_next.qh;
  1080. prev->hw->hw_next = qh->hw->hw_next;
  1081. prev->qh_next = qh->qh_next;
  1082. if (ehci->qh_scan_next == qh)
  1083. ehci->qh_scan_next = qh->qh_next.qh;
  1084. }
  1085. static void start_iaa_cycle(struct ehci_hcd *ehci)
  1086. {
  1087. /* If the controller isn't running, we don't have to wait for it */
  1088. if (unlikely(ehci->rh_state < EHCI_RH_RUNNING)) {
  1089. end_unlink_async(ehci);
  1090. /* Otherwise start a new IAA cycle if one isn't already running */
  1091. } else if (ehci->rh_state == EHCI_RH_RUNNING &&
  1092. !ehci->iaa_in_progress) {
  1093. /* Make sure the unlinks are all visible to the hardware */
  1094. wmb();
  1095. ehci_writel(ehci, ehci->command | CMD_IAAD,
  1096. &ehci->regs->command);
  1097. ehci_readl(ehci, &ehci->regs->command);
  1098. ehci->iaa_in_progress = true;
  1099. ehci_enable_event(ehci, EHCI_HRTIMER_IAA_WATCHDOG, true);
  1100. }
  1101. }
  1102. static void end_iaa_cycle(struct ehci_hcd *ehci)
  1103. {
  1104. if (ehci->has_synopsys_hc_bug)
  1105. ehci_writel(ehci, (u32) ehci->async->qh_dma,
  1106. &ehci->regs->async_next);
  1107. /* The current IAA cycle has ended */
  1108. ehci->iaa_in_progress = false;
  1109. end_unlink_async(ehci);
  1110. }
  1111. /* See if the async qh for the qtds being unlinked are now gone from the HC */
  1112. static void end_unlink_async(struct ehci_hcd *ehci)
  1113. {
  1114. struct ehci_qh *qh;
  1115. bool early_exit;
  1116. if (list_empty(&ehci->async_unlink))
  1117. return;
  1118. qh = list_first_entry(&ehci->async_unlink, struct ehci_qh,
  1119. unlink_node); /* QH whose IAA cycle just ended */
  1120. /*
  1121. * If async_unlinking is set then this routine is already running,
  1122. * either on the stack or on another CPU.
  1123. */
  1124. early_exit = ehci->async_unlinking;
  1125. /* If the controller isn't running, process all the waiting QHs */
  1126. if (ehci->rh_state < EHCI_RH_RUNNING)
  1127. list_splice_tail_init(&ehci->async_unlink, &ehci->async_idle);
  1128. /*
  1129. * Intel (?) bug: The HC can write back the overlay region even
  1130. * after the IAA interrupt occurs. In self-defense, always go
  1131. * through two IAA cycles for each QH.
  1132. */
  1133. else if (qh->qh_state == QH_STATE_UNLINK) {
  1134. /*
  1135. * Second IAA cycle has finished. Process only the first
  1136. * waiting QH (NVIDIA (?) bug).
  1137. */
  1138. list_move_tail(&qh->unlink_node, &ehci->async_idle);
  1139. }
  1140. /*
  1141. * AMD/ATI (?) bug: The HC can continue to use an active QH long
  1142. * after the IAA interrupt occurs. To prevent problems, QHs that
  1143. * may still be active will wait until 2 ms have passed with no
  1144. * change to the hw_current and hw_token fields (this delay occurs
  1145. * between the two IAA cycles).
  1146. *
  1147. * The EHCI spec (4.8.2) says that active QHs must not be removed
  1148. * from the async schedule and recommends waiting until the QH
  1149. * goes inactive. This is ridiculous because the QH will _never_
  1150. * become inactive if the endpoint NAKs indefinitely.
  1151. */
  1152. /* Some reasons for unlinking guarantee the QH can't be active */
  1153. else if (qh->unlink_reason & (QH_UNLINK_HALTED |
  1154. QH_UNLINK_SHORT_READ | QH_UNLINK_DUMMY_OVERLAY))
  1155. goto DelayDone;
  1156. /* The QH can't be active if the queue was and still is empty... */
  1157. else if ((qh->unlink_reason & QH_UNLINK_QUEUE_EMPTY) &&
  1158. list_empty(&qh->qtd_list))
  1159. goto DelayDone;
  1160. /* ... or if the QH has halted */
  1161. else if (qh->hw->hw_token & cpu_to_hc32(ehci, QTD_STS_HALT))
  1162. goto DelayDone;
  1163. /* Otherwise we have to wait until the QH stops changing */
  1164. else {
  1165. __hc32 qh_current, qh_token;
  1166. qh_current = qh->hw->hw_current;
  1167. qh_token = qh->hw->hw_token;
  1168. if (qh_current != ehci->old_current ||
  1169. qh_token != ehci->old_token) {
  1170. ehci->old_current = qh_current;
  1171. ehci->old_token = qh_token;
  1172. ehci_enable_event(ehci,
  1173. EHCI_HRTIMER_ACTIVE_UNLINK, true);
  1174. return;
  1175. }
  1176. DelayDone:
  1177. qh->qh_state = QH_STATE_UNLINK;
  1178. early_exit = true;
  1179. }
  1180. ehci->old_current = ~0; /* Prepare for next QH */
  1181. /* Start a new IAA cycle if any QHs are waiting for it */
  1182. if (!list_empty(&ehci->async_unlink))
  1183. start_iaa_cycle(ehci);
  1184. /*
  1185. * Don't allow nesting or concurrent calls,
  1186. * or wait for the second IAA cycle for the next QH.
  1187. */
  1188. if (early_exit)
  1189. return;
  1190. /* Process the idle QHs */
  1191. ehci->async_unlinking = true;
  1192. while (!list_empty(&ehci->async_idle)) {
  1193. qh = list_first_entry(&ehci->async_idle, struct ehci_qh,
  1194. unlink_node);
  1195. list_del(&qh->unlink_node);
  1196. qh->qh_state = QH_STATE_IDLE;
  1197. qh->qh_next.qh = NULL;
  1198. if (!list_empty(&qh->qtd_list))
  1199. qh_completions(ehci, qh);
  1200. if (!list_empty(&qh->qtd_list) &&
  1201. ehci->rh_state == EHCI_RH_RUNNING)
  1202. qh_link_async(ehci, qh);
  1203. disable_async(ehci);
  1204. }
  1205. ehci->async_unlinking = false;
  1206. }
  1207. static void start_unlink_async(struct ehci_hcd *ehci, struct ehci_qh *qh);
  1208. static void unlink_empty_async(struct ehci_hcd *ehci)
  1209. {
  1210. struct ehci_qh *qh;
  1211. struct ehci_qh *qh_to_unlink = NULL;
  1212. int count = 0;
  1213. /* Find the last async QH which has been empty for a timer cycle */
  1214. for (qh = ehci->async->qh_next.qh; qh; qh = qh->qh_next.qh) {
  1215. if (list_empty(&qh->qtd_list) &&
  1216. qh->qh_state == QH_STATE_LINKED) {
  1217. ++count;
  1218. if (qh->unlink_cycle != ehci->async_unlink_cycle)
  1219. qh_to_unlink = qh;
  1220. }
  1221. }
  1222. /* If nothing else is being unlinked, unlink the last empty QH */
  1223. if (list_empty(&ehci->async_unlink) && qh_to_unlink) {
  1224. qh_to_unlink->unlink_reason |= QH_UNLINK_QUEUE_EMPTY;
  1225. start_unlink_async(ehci, qh_to_unlink);
  1226. --count;
  1227. }
  1228. /* Other QHs will be handled later */
  1229. if (count > 0) {
  1230. ehci_enable_event(ehci, EHCI_HRTIMER_ASYNC_UNLINKS, true);
  1231. ++ehci->async_unlink_cycle;
  1232. }
  1233. }
  1234. #ifdef CONFIG_PM
  1235. /* The root hub is suspended; unlink all the async QHs */
  1236. static void unlink_empty_async_suspended(struct ehci_hcd *ehci)
  1237. {
  1238. struct ehci_qh *qh;
  1239. while (ehci->async->qh_next.qh) {
  1240. qh = ehci->async->qh_next.qh;
  1241. WARN_ON(!list_empty(&qh->qtd_list));
  1242. single_unlink_async(ehci, qh);
  1243. }
  1244. }
  1245. #endif
  1246. /* makes sure the async qh will become idle */
  1247. /* caller must own ehci->lock */
  1248. static void start_unlink_async(struct ehci_hcd *ehci, struct ehci_qh *qh)
  1249. {
  1250. /* If the QH isn't linked then there's nothing we can do. */
  1251. if (qh->qh_state != QH_STATE_LINKED)
  1252. return;
  1253. single_unlink_async(ehci, qh);
  1254. start_iaa_cycle(ehci);
  1255. }
  1256. /*-------------------------------------------------------------------------*/
  1257. static void scan_async (struct ehci_hcd *ehci)
  1258. {
  1259. struct ehci_qh *qh;
  1260. bool check_unlinks_later = false;
  1261. ehci->qh_scan_next = ehci->async->qh_next.qh;
  1262. while (ehci->qh_scan_next) {
  1263. qh = ehci->qh_scan_next;
  1264. ehci->qh_scan_next = qh->qh_next.qh;
  1265. /* clean any finished work for this qh */
  1266. if (!list_empty(&qh->qtd_list)) {
  1267. int temp;
  1268. /*
  1269. * Unlinks could happen here; completion reporting
  1270. * drops the lock. That's why ehci->qh_scan_next
  1271. * always holds the next qh to scan; if the next qh
  1272. * gets unlinked then ehci->qh_scan_next is adjusted
  1273. * in single_unlink_async().
  1274. */
  1275. temp = qh_completions(ehci, qh);
  1276. if (unlikely(temp)) {
  1277. start_unlink_async(ehci, qh);
  1278. } else if (list_empty(&qh->qtd_list)
  1279. && qh->qh_state == QH_STATE_LINKED) {
  1280. qh->unlink_cycle = ehci->async_unlink_cycle;
  1281. check_unlinks_later = true;
  1282. }
  1283. }
  1284. }
  1285. /*
  1286. * Unlink empty entries, reducing DMA usage as well
  1287. * as HCD schedule-scanning costs. Delay for any qh
  1288. * we just scanned, there's a not-unusual case that it
  1289. * doesn't stay idle for long.
  1290. */
  1291. if (check_unlinks_later && ehci->rh_state == EHCI_RH_RUNNING &&
  1292. !(ehci->enabled_hrtimer_events &
  1293. BIT(EHCI_HRTIMER_ASYNC_UNLINKS))) {
  1294. ehci_enable_event(ehci, EHCI_HRTIMER_ASYNC_UNLINKS, true);
  1295. ++ehci->async_unlink_cycle;
  1296. }
  1297. }